/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:21:10,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:21:10,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:21:10,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:21:10,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:21:10,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:21:10,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:21:10,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:21:10,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:21:10,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:21:10,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:21:10,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:21:10,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:21:10,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:21:10,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:21:10,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:21:10,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:21:10,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:21:10,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:21:10,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:21:10,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:21:10,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:21:10,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:21:10,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:21:10,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:21:10,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:21:10,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:21:10,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:21:10,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:21:10,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:21:10,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:21:10,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:21:10,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:21:10,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:21:10,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:21:10,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:21:10,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:21:10,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:21:10,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:21:10,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:21:10,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:21:10,537 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-27 18:21:10,559 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:21:10,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:21:10,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:21:10,560 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:21:10,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:21:10,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:21:10,561 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:21:10,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:21:10,561 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:21:10,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:21:10,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:21:10,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:10,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:21:10,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:21:10,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:21:10,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:21:10,564 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 [2023-01-27 18:21:10,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:21:10,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:21:10,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:21:10,778 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:21:10,778 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:21:10,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:11,769 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:21:11,934 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:21:11,935 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:11,943 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a0d4f6e6/b127d350fedb4d4583506e7bd2040752/FLAGe1a5cf1a5 [2023-01-27 18:21:11,952 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a0d4f6e6/b127d350fedb4d4583506e7bd2040752 [2023-01-27 18:21:11,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:21:11,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:21:11,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:11,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:21:11,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:21:11,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:11" (1/1) ... [2023-01-27 18:21:11,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb4149b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:11, skipping insertion in model container [2023-01-27 18:21:11,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:21:11" (1/1) ... [2023-01-27 18:21:11,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:21:11,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:21:12,102 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-27 18:21:12,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:12,275 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:21:12,285 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-27 18:21:12,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:21:12,360 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:12,361 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:21:12,365 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:21:12,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12 WrapperNode [2023-01-27 18:21:12,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:21:12,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:12,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:21:12,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:21:12,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,424 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-27 18:21:12,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:21:12,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:21:12,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:21:12,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:21:12,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:21:12,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:21:12,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:21:12,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:21:12,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (1/1) ... [2023-01-27 18:21:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:21:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:21:12,496 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-27 18:21:12,504 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-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:21:12,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:21:12,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:21:12,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:21:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:21:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:21:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:21:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:21:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:21:12,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:21:12,525 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:21:12,649 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:21:12,651 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:21:12,897 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:21:13,096 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:21:13,097 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:21:13,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:13 BoogieIcfgContainer [2023-01-27 18:21:13,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:21:13,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:21:13,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:21:13,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:21:13,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:21:11" (1/3) ... [2023-01-27 18:21:13,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259e1d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:13, skipping insertion in model container [2023-01-27 18:21:13,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:21:12" (2/3) ... [2023-01-27 18:21:13,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259e1d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:21:13, skipping insertion in model container [2023-01-27 18:21:13,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:21:13" (3/3) ... [2023-01-27 18:21:13,104 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-01-27 18:21:13,115 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:21:13,115 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:21:13,116 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:21:13,170 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:21:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2023-01-27 18:21:13,246 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-27 18:21:13,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:13,250 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 50 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-27 18:21:13,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2023-01-27 18:21:13,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2023-01-27 18:21:13,256 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:21:13,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-27 18:21:13,267 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2023-01-27 18:21:13,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2023-01-27 18:21:13,295 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2023-01-27 18:21:13,296 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:13,296 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 50 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-27 18:21:13,297 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-01-27 18:21:16,506 INFO L134 LiptonReduction]: Checked pairs total: 4534 [2023-01-27 18:21:16,506 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-27 18:21:16,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:21:16,520 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;@782c4fb4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:21:16,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:21:16,523 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-27 18:21:16,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:21:16,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:16,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:16,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:16,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1748915370, now seen corresponding path program 1 times [2023-01-27 18:21:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250694773] [2023-01-27 18:21:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:16,859 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-27 18:21:16,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:16,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250694773] [2023-01-27 18:21:16,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250694773] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:16,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:16,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:21:16,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905744123] [2023-01-27 18:21:16,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:16,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:21:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:21:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:21:16,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197 [2023-01-27 18:21:16,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-27 18:21:16,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:16,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197 [2023-01-27 18:21:16,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:17,075 INFO L130 PetriNetUnfolder]: 511/847 cut-off events. [2023-01-27 18:21:17,076 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-01-27 18:21:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 847 events. 511/847 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4071 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1655. Up to 580 conditions per place. [2023-01-27 18:21:17,084 INFO L137 encePairwiseOnDemand]: 194/197 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-01-27 18:21:17,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-01-27 18:21:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:21:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:21:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-01-27 18:21:17,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5143824027072758 [2023-01-27 18:21:17,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-01-27 18:21:17,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-01-27 18:21:17,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:17,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-01-27 18:21:17,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-27 18:21:17,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-27 18:21:17,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-27 18:21:17,109 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 304 transitions. [2023-01-27 18:21:17,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-01-27 18:21:17,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:21:17,113 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-27 18:21:17,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, 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-27 18:21:17,119 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-27 18:21:17,119 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-27 18:21:17,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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-27 18:21:17,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:17,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:21:17,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:17,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1375404218, now seen corresponding path program 1 times [2023-01-27 18:21:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321582210] [2023-01-27 18:21:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:17,971 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-27 18:21:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321582210] [2023-01-27 18:21:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321582210] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116232195] [2023-01-27 18:21:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:17,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:17,974 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-27 18:21:17,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:17,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:17,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:18,197 INFO L130 PetriNetUnfolder]: 1263/1934 cut-off events. [2023-01-27 18:21:18,197 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2023-01-27 18:21:18,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4050 conditions, 1934 events. 1263/1934 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9169 event pairs, 113 based on Foata normal form. 68/2002 useless extension candidates. Maximal degree in co-relation 4040. Up to 1297 conditions per place. [2023-01-27 18:21:18,207 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 37 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2023-01-27 18:21:18,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 48 transitions, 212 flow [2023-01-27 18:21:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2023-01-27 18:21:18,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46446700507614214 [2023-01-27 18:21:18,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 366 transitions. [2023-01-27 18:21:18,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 366 transitions. [2023-01-27 18:21:18,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:18,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 366 transitions. [2023-01-27 18:21:18,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 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-27 18:21:18,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:18,214 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:18,214 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 366 transitions. [2023-01-27 18:21:18,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 48 transitions, 212 flow [2023-01-27 18:21:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:18,217 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 130 flow [2023-01-27 18:21:18,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-01-27 18:21:18,217 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-01-27 18:21:18,217 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 130 flow [2023-01-27 18:21:18,218 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-27 18:21:18,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:18,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:21:18,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:18,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 312141289, now seen corresponding path program 1 times [2023-01-27 18:21:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24480482] [2023-01-27 18:21:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:18,813 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-27 18:21:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24480482] [2023-01-27 18:21:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24480482] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426740645] [2023-01-27 18:21:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:18,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:18,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:18,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 130 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-27 18:21:18,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:18,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:18,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:19,048 INFO L130 PetriNetUnfolder]: 1244/1907 cut-off events. [2023-01-27 18:21:19,049 INFO L131 PetriNetUnfolder]: For 851/851 co-relation queries the response was YES. [2023-01-27 18:21:19,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5532 conditions, 1907 events. 1244/1907 cut-off events. For 851/851 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8803 event pairs, 134 based on Foata normal form. 8/1915 useless extension candidates. Maximal degree in co-relation 5519. Up to 1257 conditions per place. [2023-01-27 18:21:19,060 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 41 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2023-01-27 18:21:19,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 348 flow [2023-01-27 18:21:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-01-27 18:21:19,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573604060913704 [2023-01-27 18:21:19,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:19,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:19,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:19,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:19,065 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 130 flow. Second operand 4 states and 367 transitions. [2023-01-27 18:21:19,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 348 flow [2023-01-27 18:21:19,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:21:19,068 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 258 flow [2023-01-27 18:21:19,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-01-27 18:21:19,069 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-01-27 18:21:19,071 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 258 flow [2023-01-27 18:21:19,072 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-27 18:21:19,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:19,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:19,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:21:19,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:19,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1084925299, now seen corresponding path program 1 times [2023-01-27 18:21:19,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:19,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343208558] [2023-01-27 18:21:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:19,639 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-27 18:21:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343208558] [2023-01-27 18:21:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343208558] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:19,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792567063] [2023-01-27 18:21:19,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:19,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:19,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:19,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:19,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 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-27 18:21:19,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:19,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:19,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:19,880 INFO L130 PetriNetUnfolder]: 1478/2305 cut-off events. [2023-01-27 18:21:19,880 INFO L131 PetriNetUnfolder]: For 3297/3297 co-relation queries the response was YES. [2023-01-27 18:21:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 2305 events. 1478/2305 cut-off events. For 3297/3297 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11318 event pairs, 380 based on Foata normal form. 50/2355 useless extension candidates. Maximal degree in co-relation 8108. Up to 1141 conditions per place. [2023-01-27 18:21:19,889 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 45 selfloop transitions, 23 changer transitions 0/68 dead transitions. [2023-01-27 18:21:19,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 522 flow [2023-01-27 18:21:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-01-27 18:21:19,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573604060913704 [2023-01-27 18:21:19,891 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:19,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-01-27 18:21:19,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:19,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:19,893 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:19,893 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 258 flow. Second operand 4 states and 367 transitions. [2023-01-27 18:21:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 522 flow [2023-01-27 18:21:19,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 520 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-27 18:21:19,897 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 432 flow [2023-01-27 18:21:19,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2023-01-27 18:21:19,898 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-01-27 18:21:19,898 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 432 flow [2023-01-27 18:21:19,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 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-27 18:21:19,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:19,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:21:19,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:19,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1084985842, now seen corresponding path program 1 times [2023-01-27 18:21:19,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:19,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325917426] [2023-01-27 18:21:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:20,191 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-27 18:21:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325917426] [2023-01-27 18:21:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325917426] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:20,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:20,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843563606] [2023-01-27 18:21:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:20,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:20,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 197 [2023-01-27 18:21:20,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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-27 18:21:20,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:20,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 197 [2023-01-27 18:21:20,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:20,419 INFO L130 PetriNetUnfolder]: 1268/2054 cut-off events. [2023-01-27 18:21:20,419 INFO L131 PetriNetUnfolder]: For 5304/5312 co-relation queries the response was YES. [2023-01-27 18:21:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8478 conditions, 2054 events. 1268/2054 cut-off events. For 5304/5312 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10511 event pairs, 290 based on Foata normal form. 8/2033 useless extension candidates. Maximal degree in co-relation 8455. Up to 1753 conditions per place. [2023-01-27 18:21:20,428 INFO L137 encePairwiseOnDemand]: 193/197 looper letters, 45 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-01-27 18:21:20,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 622 flow [2023-01-27 18:21:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:21:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:21:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-01-27 18:21:20,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494077834179357 [2023-01-27 18:21:20,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-01-27 18:21:20,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-01-27 18:21:20,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:20,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-01-27 18:21:20,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-27 18:21:20,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-27 18:21:20,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-27 18:21:20,432 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 432 flow. Second operand 3 states and 292 transitions. [2023-01-27 18:21:20,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 622 flow [2023-01-27 18:21:20,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 595 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:20,437 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 449 flow [2023-01-27 18:21:20,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2023-01-27 18:21:20,437 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-01-27 18:21:20,438 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 449 flow [2023-01-27 18:21:20,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 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-27 18:21:20,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:20,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:20,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:21:20,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:20,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1521680318, now seen corresponding path program 1 times [2023-01-27 18:21:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684519277] [2023-01-27 18:21:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:20,657 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-27 18:21:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684519277] [2023-01-27 18:21:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684519277] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:20,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:21:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760488897] [2023-01-27 18:21:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:20,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 197 [2023-01-27 18:21:20,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 449 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-27 18:21:20,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:20,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 197 [2023-01-27 18:21:20,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:20,857 INFO L130 PetriNetUnfolder]: 1283/2076 cut-off events. [2023-01-27 18:21:20,857 INFO L131 PetriNetUnfolder]: For 4846/4858 co-relation queries the response was YES. [2023-01-27 18:21:20,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8796 conditions, 2076 events. 1283/2076 cut-off events. For 4846/4858 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10654 event pairs, 164 based on Foata normal form. 12/2062 useless extension candidates. Maximal degree in co-relation 8771. Up to 1504 conditions per place. [2023-01-27 18:21:20,868 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 50 selfloop transitions, 12 changer transitions 1/73 dead transitions. [2023-01-27 18:21:20,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 739 flow [2023-01-27 18:21:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-01-27 18:21:20,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025380710659898 [2023-01-27 18:21:20,870 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-01-27 18:21:20,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-01-27 18:21:20,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:20,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-01-27 18:21:20,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-27 18:21:20,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:20,873 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:20,873 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 449 flow. Second operand 4 states and 396 transitions. [2023-01-27 18:21:20,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 739 flow [2023-01-27 18:21:20,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:20,899 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 526 flow [2023-01-27 18:21:20,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2023-01-27 18:21:20,902 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-01-27 18:21:20,902 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 526 flow [2023-01-27 18:21:20,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-27 18:21:20,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:20,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:20,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:21:20,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:20,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1503212466, now seen corresponding path program 2 times [2023-01-27 18:21:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:20,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060561254] [2023-01-27 18:21:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:21,176 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-27 18:21:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:21,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060561254] [2023-01-27 18:21:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060561254] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558684367] [2023-01-27 18:21:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:21:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:21:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:21:21,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 197 [2023-01-27 18:21:21,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 526 flow. Second operand has 5 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-27 18:21:21,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:21,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 197 [2023-01-27 18:21:21,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:21,394 INFO L130 PetriNetUnfolder]: 1266/2047 cut-off events. [2023-01-27 18:21:21,394 INFO L131 PetriNetUnfolder]: For 6368/6392 co-relation queries the response was YES. [2023-01-27 18:21:21,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9230 conditions, 2047 events. 1266/2047 cut-off events. For 6368/6392 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10426 event pairs, 175 based on Foata normal form. 22/2036 useless extension candidates. Maximal degree in co-relation 9203. Up to 1495 conditions per place. [2023-01-27 18:21:21,409 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 49 selfloop transitions, 15 changer transitions 0/74 dead transitions. [2023-01-27 18:21:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 798 flow [2023-01-27 18:21:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-01-27 18:21:21,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49111675126903553 [2023-01-27 18:21:21,411 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-01-27 18:21:21,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-01-27 18:21:21,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:21,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-01-27 18:21:21,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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-27 18:21:21,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:21,413 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:21,413 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 526 flow. Second operand 4 states and 387 transitions. [2023-01-27 18:21:21,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 798 flow [2023-01-27 18:21:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 784 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:21,423 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 599 flow [2023-01-27 18:21:21,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2023-01-27 18:21:21,424 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2023-01-27 18:21:21,424 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 599 flow [2023-01-27 18:21:21,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-27 18:21:21,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:21,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:21,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:21:21,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:21,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1503301343, now seen corresponding path program 1 times [2023-01-27 18:21:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:21,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523354559] [2023-01-27 18:21:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:21,773 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-27 18:21:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523354559] [2023-01-27 18:21:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523354559] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514569124] [2023-01-27 18:21:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:21,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:21:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:21:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:21:21,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-01-27 18:21:21,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-27 18:21:21,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:21,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-01-27 18:21:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:21,979 INFO L130 PetriNetUnfolder]: 1237/2001 cut-off events. [2023-01-27 18:21:21,979 INFO L131 PetriNetUnfolder]: For 7613/7649 co-relation queries the response was YES. [2023-01-27 18:21:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9307 conditions, 2001 events. 1237/2001 cut-off events. For 7613/7649 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10179 event pairs, 197 based on Foata normal form. 36/2005 useless extension candidates. Maximal degree in co-relation 9278. Up to 1552 conditions per place. [2023-01-27 18:21:21,993 INFO L137 encePairwiseOnDemand]: 192/197 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-01-27 18:21:21,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 953 flow [2023-01-27 18:21:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-01-27 18:21:21,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860406091370558 [2023-01-27 18:21:21,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-01-27 18:21:21,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-01-27 18:21:21,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:21,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-01-27 18:21:21,998 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-27 18:21:21,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:21,999 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:21,999 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 599 flow. Second operand 4 states and 383 transitions. [2023-01-27 18:21:21,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 953 flow [2023-01-27 18:21:22,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 939 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:22,006 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 657 flow [2023-01-27 18:21:22,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2023-01-27 18:21:22,009 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2023-01-27 18:21:22,009 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 657 flow [2023-01-27 18:21:22,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 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-27 18:21:22,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:22,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:22,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:21:22,009 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:22,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash -642346439, now seen corresponding path program 1 times [2023-01-27 18:21:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987480772] [2023-01-27 18:21:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:22,852 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-27 18:21:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:22,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987480772] [2023-01-27 18:21:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987480772] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:22,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657300537] [2023-01-27 18:21:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:22,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:22,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-01-27 18:21:22,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 657 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-27 18:21:22,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:22,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-01-27 18:21:22,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:23,191 INFO L130 PetriNetUnfolder]: 1509/2351 cut-off events. [2023-01-27 18:21:23,191 INFO L131 PetriNetUnfolder]: For 9338/9338 co-relation queries the response was YES. [2023-01-27 18:21:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11104 conditions, 2351 events. 1509/2351 cut-off events. For 9338/9338 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11285 event pairs, 52 based on Foata normal form. 15/2366 useless extension candidates. Maximal degree in co-relation 11073. Up to 1241 conditions per place. [2023-01-27 18:21:23,202 INFO L137 encePairwiseOnDemand]: 186/197 looper letters, 56 selfloop transitions, 42 changer transitions 10/108 dead transitions. [2023-01-27 18:21:23,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 1212 flow [2023-01-27 18:21:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 530 transitions. [2023-01-27 18:21:23,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44839255499153974 [2023-01-27 18:21:23,204 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 530 transitions. [2023-01-27 18:21:23,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 530 transitions. [2023-01-27 18:21:23,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:23,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 530 transitions. [2023-01-27 18:21:23,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:23,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:23,206 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:23,206 INFO L175 Difference]: Start difference. First operand has 56 places, 63 transitions, 657 flow. Second operand 6 states and 530 transitions. [2023-01-27 18:21:23,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 1212 flow [2023-01-27 18:21:23,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 1192 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:23,214 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 932 flow [2023-01-27 18:21:23,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=932, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2023-01-27 18:21:23,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2023-01-27 18:21:23,215 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 932 flow [2023-01-27 18:21:23,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 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-27 18:21:23,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:23,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:23,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:21:23,215 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:23,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1008496799, now seen corresponding path program 1 times [2023-01-27 18:21:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:23,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137916421] [2023-01-27 18:21:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:23,592 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-27 18:21:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137916421] [2023-01-27 18:21:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137916421] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:23,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150699737] [2023-01-27 18:21:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:23,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:23,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:23,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:23,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:23,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:23,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:23,919 INFO L130 PetriNetUnfolder]: 1458/2272 cut-off events. [2023-01-27 18:21:23,919 INFO L131 PetriNetUnfolder]: For 13761/13761 co-relation queries the response was YES. [2023-01-27 18:21:23,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12623 conditions, 2272 events. 1458/2272 cut-off events. For 13761/13761 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10807 event pairs, 160 based on Foata normal form. 9/2281 useless extension candidates. Maximal degree in co-relation 12588. Up to 1899 conditions per place. [2023-01-27 18:21:23,930 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 87 selfloop transitions, 43 changer transitions 12/142 dead transitions. [2023-01-27 18:21:23,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1977 flow [2023-01-27 18:21:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2023-01-27 18:21:23,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44887599709934733 [2023-01-27 18:21:23,933 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2023-01-27 18:21:23,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2023-01-27 18:21:23,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:23,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2023-01-27 18:21:23,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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-27 18:21:23,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:23,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:23,935 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 932 flow. Second operand 7 states and 619 transitions. [2023-01-27 18:21:23,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1977 flow [2023-01-27 18:21:23,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 142 transitions, 1933 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:23,950 INFO L231 Difference]: Finished difference. Result has 70 places, 100 transitions, 1439 flow [2023-01-27 18:21:23,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1439, PETRI_PLACES=70, PETRI_TRANSITIONS=100} [2023-01-27 18:21:23,951 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2023-01-27 18:21:23,951 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 100 transitions, 1439 flow [2023-01-27 18:21:23,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:23,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:23,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:23,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:21:23,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:23,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1005699359, now seen corresponding path program 2 times [2023-01-27 18:21:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:23,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882891168] [2023-01-27 18:21:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:24,163 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-27 18:21:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882891168] [2023-01-27 18:21:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882891168] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:24,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:24,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399519520] [2023-01-27 18:21:24,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:24,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:21:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:24,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:21:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:21:24,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 197 [2023-01-27 18:21:24,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 100 transitions, 1439 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 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-27 18:21:24,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:24,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 197 [2023-01-27 18:21:24,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:24,427 INFO L130 PetriNetUnfolder]: 1345/2178 cut-off events. [2023-01-27 18:21:24,427 INFO L131 PetriNetUnfolder]: For 18211/18300 co-relation queries the response was YES. [2023-01-27 18:21:24,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13284 conditions, 2178 events. 1345/2178 cut-off events. For 18211/18300 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11427 event pairs, 166 based on Foata normal form. 95/2256 useless extension candidates. Maximal degree in co-relation 13246. Up to 1517 conditions per place. [2023-01-27 18:21:24,439 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 82 selfloop transitions, 29 changer transitions 1/127 dead transitions. [2023-01-27 18:21:24,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 127 transitions, 1954 flow [2023-01-27 18:21:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2023-01-27 18:21:24,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-01-27 18:21:24,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 570 transitions. [2023-01-27 18:21:24,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions. [2023-01-27 18:21:24,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:24,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions. [2023-01-27 18:21:24,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 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-27 18:21:24,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:24,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:24,445 INFO L175 Difference]: Start difference. First operand has 70 places, 100 transitions, 1439 flow. Second operand 6 states and 570 transitions. [2023-01-27 18:21:24,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 127 transitions, 1954 flow [2023-01-27 18:21:24,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 127 transitions, 1922 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:24,465 INFO L231 Difference]: Finished difference. Result has 74 places, 108 transitions, 1637 flow [2023-01-27 18:21:24,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1637, PETRI_PLACES=74, PETRI_TRANSITIONS=108} [2023-01-27 18:21:24,466 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2023-01-27 18:21:24,466 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 108 transitions, 1637 flow [2023-01-27 18:21:24,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 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-27 18:21:24,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:24,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:24,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:21:24,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:24,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -643743733, now seen corresponding path program 3 times [2023-01-27 18:21:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170469542] [2023-01-27 18:21:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:24,816 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-27 18:21:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:24,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170469542] [2023-01-27 18:21:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170469542] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:24,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037326123] [2023-01-27 18:21:24,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:24,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:24,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-01-27 18:21:24,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 108 transitions, 1637 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-27 18:21:24,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:24,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-01-27 18:21:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:25,113 INFO L130 PetriNetUnfolder]: 1339/2183 cut-off events. [2023-01-27 18:21:25,113 INFO L131 PetriNetUnfolder]: For 20750/20913 co-relation queries the response was YES. [2023-01-27 18:21:25,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14277 conditions, 2183 events. 1339/2183 cut-off events. For 20750/20913 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11556 event pairs, 177 based on Foata normal form. 168/2334 useless extension candidates. Maximal degree in co-relation 14237. Up to 1496 conditions per place. [2023-01-27 18:21:25,124 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 90 selfloop transitions, 20 changer transitions 1/126 dead transitions. [2023-01-27 18:21:25,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 2072 flow [2023-01-27 18:21:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:21:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:21:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2023-01-27 18:21:25,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46598984771573604 [2023-01-27 18:21:25,126 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 459 transitions. [2023-01-27 18:21:25,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 459 transitions. [2023-01-27 18:21:25,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:25,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 459 transitions. [2023-01-27 18:21:25,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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-27 18:21:25,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-27 18:21:25,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-27 18:21:25,128 INFO L175 Difference]: Start difference. First operand has 74 places, 108 transitions, 1637 flow. Second operand 5 states and 459 transitions. [2023-01-27 18:21:25,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 2072 flow [2023-01-27 18:21:25,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 2047 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 18:21:25,148 INFO L231 Difference]: Finished difference. Result has 76 places, 113 transitions, 1769 flow [2023-01-27 18:21:25,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1769, PETRI_PLACES=76, PETRI_TRANSITIONS=113} [2023-01-27 18:21:25,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-01-27 18:21:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 113 transitions, 1769 flow [2023-01-27 18:21:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-27 18:21:25,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:25,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:21:25,149 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:25,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1591098199, now seen corresponding path program 4 times [2023-01-27 18:21:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264377892] [2023-01-27 18:21:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:25,505 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-27 18:21:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264377892] [2023-01-27 18:21:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264377892] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994643306] [2023-01-27 18:21:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:25,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:25,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:25,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 113 transitions, 1769 flow. Second operand has 7 states, 7 states have (on average 80.85714285714286) internal successors, (566), 7 states have internal predecessors, (566), 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-27 18:21:25,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:25,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:25,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:25,894 INFO L130 PetriNetUnfolder]: 1660/2622 cut-off events. [2023-01-27 18:21:25,894 INFO L131 PetriNetUnfolder]: For 25785/25785 co-relation queries the response was YES. [2023-01-27 18:21:25,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17203 conditions, 2622 events. 1660/2622 cut-off events. For 25785/25785 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13303 event pairs, 268 based on Foata normal form. 16/2638 useless extension candidates. Maximal degree in co-relation 17162. Up to 1611 conditions per place. [2023-01-27 18:21:25,907 INFO L137 encePairwiseOnDemand]: 190/197 looper letters, 109 selfloop transitions, 45 changer transitions 14/168 dead transitions. [2023-01-27 18:21:25,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 168 transitions, 2817 flow [2023-01-27 18:21:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2023-01-27 18:21:25,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44923857868020306 [2023-01-27 18:21:25,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 531 transitions. [2023-01-27 18:21:25,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 531 transitions. [2023-01-27 18:21:25,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:25,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 531 transitions. [2023-01-27 18:21:25,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 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-27 18:21:25,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:25,912 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:25,912 INFO L175 Difference]: Start difference. First operand has 76 places, 113 transitions, 1769 flow. Second operand 6 states and 531 transitions. [2023-01-27 18:21:25,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 168 transitions, 2817 flow [2023-01-27 18:21:25,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 168 transitions, 2776 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:25,938 INFO L231 Difference]: Finished difference. Result has 81 places, 117 transitions, 1940 flow [2023-01-27 18:21:25,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=81, PETRI_TRANSITIONS=117} [2023-01-27 18:21:25,939 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-01-27 18:21:25,939 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 117 transitions, 1940 flow [2023-01-27 18:21:25,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.85714285714286) internal successors, (566), 7 states have internal predecessors, (566), 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-27 18:21:25,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:25,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:25,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:21:25,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:25,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 933724453, now seen corresponding path program 1 times [2023-01-27 18:21:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:25,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229249452] [2023-01-27 18:21:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:26,365 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-27 18:21:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229249452] [2023-01-27 18:21:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229249452] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003567910] [2023-01-27 18:21:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:26,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:26,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:26,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 197 [2023-01-27 18:21:26,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 117 transitions, 1940 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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-27 18:21:26,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:26,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 197 [2023-01-27 18:21:26,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:26,806 INFO L130 PetriNetUnfolder]: 2090/3409 cut-off events. [2023-01-27 18:21:26,806 INFO L131 PetriNetUnfolder]: For 34576/34576 co-relation queries the response was YES. [2023-01-27 18:21:26,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21946 conditions, 3409 events. 2090/3409 cut-off events. For 34576/34576 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 19431 event pairs, 357 based on Foata normal form. 40/3449 useless extension candidates. Maximal degree in co-relation 21903. Up to 1583 conditions per place. [2023-01-27 18:21:26,824 INFO L137 encePairwiseOnDemand]: 187/197 looper letters, 112 selfloop transitions, 29 changer transitions 17/158 dead transitions. [2023-01-27 18:21:26,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 158 transitions, 2760 flow [2023-01-27 18:21:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-27 18:21:26,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619289340101523 [2023-01-27 18:21:26,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-27 18:21:26,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-27 18:21:26,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:26,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-27 18:21:26,826 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-27 18:21:26,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:26,827 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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-27 18:21:26,828 INFO L175 Difference]: Start difference. First operand has 81 places, 117 transitions, 1940 flow. Second operand 4 states and 364 transitions. [2023-01-27 18:21:26,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 158 transitions, 2760 flow [2023-01-27 18:21:26,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 158 transitions, 2706 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-27 18:21:26,870 INFO L231 Difference]: Finished difference. Result has 84 places, 110 transitions, 1916 flow [2023-01-27 18:21:26,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1916, PETRI_PLACES=84, PETRI_TRANSITIONS=110} [2023-01-27 18:21:26,870 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2023-01-27 18:21:26,871 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 110 transitions, 1916 flow [2023-01-27 18:21:26,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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-27 18:21:26,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:26,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:26,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:21:26,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:26,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1198718836, now seen corresponding path program 1 times [2023-01-27 18:21:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262920019] [2023-01-27 18:21:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:26,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:27,283 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-27 18:21:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262920019] [2023-01-27 18:21:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262920019] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871799681] [2023-01-27 18:21:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:27,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:27,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-01-27 18:21:27,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 110 transitions, 1916 flow. Second operand has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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-27 18:21:27,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:27,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-01-27 18:21:27,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:27,666 INFO L130 PetriNetUnfolder]: 1421/2445 cut-off events. [2023-01-27 18:21:27,667 INFO L131 PetriNetUnfolder]: For 30953/31324 co-relation queries the response was YES. [2023-01-27 18:21:27,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16280 conditions, 2445 events. 1421/2445 cut-off events. For 30953/31324 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14559 event pairs, 267 based on Foata normal form. 157/2574 useless extension candidates. Maximal degree in co-relation 16234. Up to 1468 conditions per place. [2023-01-27 18:21:27,683 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 75 selfloop transitions, 39 changer transitions 30/150 dead transitions. [2023-01-27 18:21:27,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 150 transitions, 2650 flow [2023-01-27 18:21:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2023-01-27 18:21:27,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662799129804206 [2023-01-27 18:21:27,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2023-01-27 18:21:27,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2023-01-27 18:21:27,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:27,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2023-01-27 18:21:27,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-27 18:21:27,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:27,688 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:27,688 INFO L175 Difference]: Start difference. First operand has 84 places, 110 transitions, 1916 flow. Second operand 7 states and 643 transitions. [2023-01-27 18:21:27,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 150 transitions, 2650 flow [2023-01-27 18:21:27,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 150 transitions, 2599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:27,729 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 1715 flow [2023-01-27 18:21:27,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1715, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2023-01-27 18:21:27,730 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2023-01-27 18:21:27,730 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 1715 flow [2023-01-27 18:21:27,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 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-27 18:21:27,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:27,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:27,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:21:27,731 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:27,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash -597213392, now seen corresponding path program 1 times [2023-01-27 18:21:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841558113] [2023-01-27 18:21:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:27,868 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-27 18:21:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:27,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841558113] [2023-01-27 18:21:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841558113] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:27,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:27,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531654322] [2023-01-27 18:21:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:27,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:27,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:27,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:27,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-01-27 18:21:27,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 1715 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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-27 18:21:27,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:27,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-01-27 18:21:27,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:28,013 INFO L130 PetriNetUnfolder]: 513/950 cut-off events. [2023-01-27 18:21:28,013 INFO L131 PetriNetUnfolder]: For 19063/19232 co-relation queries the response was YES. [2023-01-27 18:21:28,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6577 conditions, 950 events. 513/950 cut-off events. For 19063/19232 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5197 event pairs, 76 based on Foata normal form. 293/1240 useless extension candidates. Maximal degree in co-relation 6528. Up to 576 conditions per place. [2023-01-27 18:21:28,018 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 72 selfloop transitions, 4 changer transitions 62/146 dead transitions. [2023-01-27 18:21:28,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 146 transitions, 2874 flow [2023-01-27 18:21:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:21:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:21:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2023-01-27 18:21:28,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730964467005076 [2023-01-27 18:21:28,020 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 466 transitions. [2023-01-27 18:21:28,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 466 transitions. [2023-01-27 18:21:28,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:28,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 466 transitions. [2023-01-27 18:21:28,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 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-27 18:21:28,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-27 18:21:28,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-27 18:21:28,023 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 1715 flow. Second operand 5 states and 466 transitions. [2023-01-27 18:21:28,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 146 transitions, 2874 flow [2023-01-27 18:21:28,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 2432 flow, removed 89 selfloop flow, removed 17 redundant places. [2023-01-27 18:21:28,040 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 987 flow [2023-01-27 18:21:28,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=987, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2023-01-27 18:21:28,040 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-01-27 18:21:28,040 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 987 flow [2023-01-27 18:21:28,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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-27 18:21:28,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:28,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:21:28,041 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:28,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 157601065, now seen corresponding path program 1 times [2023-01-27 18:21:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643388003] [2023-01-27 18:21:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:28,162 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-27 18:21:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643388003] [2023-01-27 18:21:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643388003] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:21:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457651228] [2023-01-27 18:21:28,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:28,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:21:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:21:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:21:28,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-01-27 18:21:28,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 987 flow. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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-27 18:21:28,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:28,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-01-27 18:21:28,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:28,275 INFO L130 PetriNetUnfolder]: 238/489 cut-off events. [2023-01-27 18:21:28,275 INFO L131 PetriNetUnfolder]: For 8386/8475 co-relation queries the response was YES. [2023-01-27 18:21:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 489 events. 238/489 cut-off events. For 8386/8475 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2454 event pairs, 10 based on Foata normal form. 164/651 useless extension candidates. Maximal degree in co-relation 3148. Up to 228 conditions per place. [2023-01-27 18:21:28,277 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 71 selfloop transitions, 7 changer transitions 40/126 dead transitions. [2023-01-27 18:21:28,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 2043 flow [2023-01-27 18:21:28,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:21:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:21:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2023-01-27 18:21:28,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703891708967851 [2023-01-27 18:21:28,279 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 556 transitions. [2023-01-27 18:21:28,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 556 transitions. [2023-01-27 18:21:28,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:28,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 556 transitions. [2023-01-27 18:21:28,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 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-27 18:21:28,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:28,282 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-27 18:21:28,282 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 987 flow. Second operand 6 states and 556 transitions. [2023-01-27 18:21:28,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 2043 flow [2023-01-27 18:21:28,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 1947 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-01-27 18:21:28,290 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 851 flow [2023-01-27 18:21:28,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=851, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2023-01-27 18:21:28,290 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2023-01-27 18:21:28,291 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 851 flow [2023-01-27 18:21:28,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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-27 18:21:28,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:28,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:28,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:21:28,291 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:28,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash 427456573, now seen corresponding path program 1 times [2023-01-27 18:21:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020945996] [2023-01-27 18:21:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:28,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:28,421 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-27 18:21:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:28,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020945996] [2023-01-27 18:21:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020945996] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:28,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700175392] [2023-01-27 18:21:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:28,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:28,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:28,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-01-27 18:21:28,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-27 18:21:28,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:28,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-01-27 18:21:28,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:28,499 INFO L130 PetriNetUnfolder]: 121/278 cut-off events. [2023-01-27 18:21:28,499 INFO L131 PetriNetUnfolder]: For 3176/3234 co-relation queries the response was YES. [2023-01-27 18:21:28,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 278 events. 121/278 cut-off events. For 3176/3234 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1232 event pairs, 4 based on Foata normal form. 71/346 useless extension candidates. Maximal degree in co-relation 1817. Up to 126 conditions per place. [2023-01-27 18:21:28,501 INFO L137 encePairwiseOnDemand]: 191/197 looper letters, 36 selfloop transitions, 10 changer transitions 44/94 dead transitions. [2023-01-27 18:21:28,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 1413 flow [2023-01-27 18:21:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2023-01-27 18:21:28,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45830311820159536 [2023-01-27 18:21:28,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2023-01-27 18:21:28,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2023-01-27 18:21:28,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:28,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2023-01-27 18:21:28,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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-27 18:21:28,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:28,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-27 18:21:28,506 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 851 flow. Second operand 7 states and 632 transitions. [2023-01-27 18:21:28,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 1413 flow [2023-01-27 18:21:28,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 1227 flow, removed 47 selfloop flow, removed 10 redundant places. [2023-01-27 18:21:28,511 INFO L231 Difference]: Finished difference. Result has 78 places, 35 transitions, 351 flow [2023-01-27 18:21:28,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=78, PETRI_TRANSITIONS=35} [2023-01-27 18:21:28,512 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2023-01-27 18:21:28,512 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 35 transitions, 351 flow [2023-01-27 18:21:28,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-27 18:21:28,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:28,512 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-27 18:21:28,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 18:21:28,512 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:21:28,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash -554742058, now seen corresponding path program 1 times [2023-01-27 18:21:28,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364425035] [2023-01-27 18:21:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:28,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:21:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:28,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:21:28,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:21:28,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:21:28,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:21:28,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:21:28,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:21:28,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:21:28,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:21:28,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-27 18:21:28,572 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:28,576 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:21:28,576 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:21:28,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:21:28 BasicIcfg [2023-01-27 18:21:28,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:21:28,608 INFO L158 Benchmark]: Toolchain (without parser) took 16654.11ms. Allocated memory was 343.9MB in the beginning and 908.1MB in the end (delta: 564.1MB). Free memory was 289.3MB in the beginning and 768.3MB in the end (delta: -479.0MB). Peak memory consumption was 86.6MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.74ms. Allocated memory is still 343.9MB. Free memory was 289.3MB in the beginning and 311.7MB in the end (delta: -22.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.59ms. Allocated memory is still 343.9MB. Free memory was 311.7MB in the beginning and 309.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: Boogie Preprocessor took 31.72ms. Allocated memory is still 343.9MB. Free memory was 309.2MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: RCFGBuilder took 629.59ms. Allocated memory is still 343.9MB. Free memory was 307.1MB in the beginning and 272.4MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,609 INFO L158 Benchmark]: TraceAbstraction took 15508.23ms. Allocated memory was 343.9MB in the beginning and 908.1MB in the end (delta: 564.1MB). Free memory was 271.9MB in the beginning and 768.3MB in the end (delta: -496.4MB). Peak memory consumption was 67.3MB. Max. memory is 16.0GB. [2023-01-27 18:21:28,610 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 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.74ms. Allocated memory is still 343.9MB. Free memory was 289.3MB in the beginning and 311.7MB in the end (delta: -22.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.59ms. Allocated memory is still 343.9MB. Free memory was 311.7MB in the beginning and 309.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.72ms. Allocated memory is still 343.9MB. Free memory was 309.2MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 629.59ms. Allocated memory is still 343.9MB. Free memory was 307.1MB in the beginning and 272.4MB in the end (delta: 34.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 15508.23ms. Allocated memory was 343.9MB in the beginning and 908.1MB in the end (delta: 564.1MB). Free memory was 271.9MB in the beginning and 768.3MB in the end (delta: -496.4MB). Peak memory consumption was 67.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 110 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 22 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4534 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1956, independent: 1791, independent conditional: 0, independent unconditional: 1791, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 993, independent: 945, independent conditional: 0, independent unconditional: 945, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1956, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 993, unknown conditional: 0, unknown unconditional: 993] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 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, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 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 [__unbuffered_cnt=0, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=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: 812]: 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. - 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: 15.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1220 IncrementalHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 44 mSDtfsCounter, 1220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1940occurred in iteration=13, InterpolantAutomatonStates: 89, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 2269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-27 18:21:28,628 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...