/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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:16:35,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:16:35,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:16:35,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:16:35,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:16:35,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:16:35,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:16:35,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:16:35,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:16:35,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:16:35,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:16:35,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:16:35,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:16:35,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:16:35,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:16:35,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:16:35,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:16:35,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:16:35,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:16:35,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:16:35,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:16:35,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:16:35,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:16:35,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:16:35,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:16:35,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:16:35,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:16:35,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:16:35,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:16:35,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:16:35,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:16:35,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:16:35,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:16:35,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:16:35,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:16:35,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:16:35,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:16:35,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:16:35,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:16:35,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:16:35,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:16:35,444 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:16:35,473 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:16:35,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:16:35,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:16:35,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:16:35,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:16:35,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:16:35,475 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:16:35,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:16:35,475 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:16:35,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:16:35,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:16:35,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:16:35,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:16:35,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:16:35,478 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:16:35,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:16:35,478 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:16:35,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:16:35,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:16:35,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:16:35,695 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:16:35,695 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:16:35,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:16:36,649 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:16:36,846 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:16:36,846 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:16:36,860 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6291e317d/7d9979129f3e4412b19986b388503d22/FLAGc6b57db50 [2023-01-27 18:16:36,869 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6291e317d/7d9979129f3e4412b19986b388503d22 [2023-01-27 18:16:36,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:16:36,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:16:36,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:16:36,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:16:36,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:16:36,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:16:36" (1/1) ... [2023-01-27 18:16:36,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209c9b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:36, skipping insertion in model container [2023-01-27 18:16:36,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:16:36" (1/1) ... [2023-01-27 18:16:36,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:16:36,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:16:37,007 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-01-27 18:16:37,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:16:37,207 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:16:37,216 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-01-27 18:16:37,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:16:37,276 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:16:37,276 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:16:37,282 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:16:37,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37 WrapperNode [2023-01-27 18:16:37,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:16:37,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:16:37,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:16:37,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:16:37,293 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:16:37" (1/1) ... [2023-01-27 18:16:37,304 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:16:37" (1/1) ... [2023-01-27 18:16:37,321 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-01-27 18:16:37,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:16:37,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:16:37,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:16:37,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:16:37,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:16:37,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:16:37,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:16:37,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:16:37,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (1/1) ... [2023-01-27 18:16:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:16:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:16:37,378 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:16:37,397 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:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:16:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:16:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:16:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:16:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:16:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:16:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:16:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:16:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:16:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:16:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:16:37,411 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:16:37,509 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:16:37,511 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:16:37,770 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:16:37,895 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:16:37,896 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:16:37,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:16:37 BoogieIcfgContainer [2023-01-27 18:16:37,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:16:37,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:16:37,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:16:37,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:16:37,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:16:36" (1/3) ... [2023-01-27 18:16:37,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147e303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:16:37, skipping insertion in model container [2023-01-27 18:16:37,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:16:37" (2/3) ... [2023-01-27 18:16:37,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@147e303d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:16:37, skipping insertion in model container [2023-01-27 18:16:37,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:16:37" (3/3) ... [2023-01-27 18:16:37,907 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-01-27 18:16:37,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:16:37,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:16:37,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:16:37,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:16:38,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:16:38,044 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:16:38,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:16:38,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:16:38,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:16:38,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:38,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:16:38,060 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:38,061 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:38,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-27 18:16:38,092 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:16:38,093 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:16:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:16:38,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-27 18:16:40,898 INFO L134 LiptonReduction]: Checked pairs total: 4542 [2023-01-27 18:16:40,898 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-01-27 18:16:40,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:16:40,912 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;@322b1e07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:16:40,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:16:40,915 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:16:40,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:16:40,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:40,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:16:40,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:40,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 440961859, now seen corresponding path program 1 times [2023-01-27 18:16:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495434531] [2023-01-27 18:16:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:41,232 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:16:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:41,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495434531] [2023-01-27 18:16:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495434531] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:41,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:41,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:16:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503032789] [2023-01-27 18:16:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:41,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:16:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:41,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:16:41,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:16:41,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-01-27 18:16:41,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:16:41,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:41,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-01-27 18:16:41,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:41,455 INFO L130 PetriNetUnfolder]: 711/1168 cut-off events. [2023-01-27 18:16:41,456 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-27 18:16:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1168 events. 711/1168 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5622 event pairs, 117 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 2276. Up to 859 conditions per place. [2023-01-27 18:16:41,462 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-01-27 18:16:41,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-01-27 18:16:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:16:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:16:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:16:41,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2023-01-27 18:16:41,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:16:41,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:16:41,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:41,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:16:41,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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:16:41,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:41,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:41,487 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:16:41,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-01-27 18:16:41,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:16:41,490 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-27 18:16:41,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, 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:16:41,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-27 18:16:41,494 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-27 18:16:41,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:16:41,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:41,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:41,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:16:41,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:41,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1675886639, now seen corresponding path program 1 times [2023-01-27 18:16:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151919245] [2023-01-27 18:16:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:41,756 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:16:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151919245] [2023-01-27 18:16:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151919245] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:41,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:41,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:16:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962633955] [2023-01-27 18:16:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:16:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:16:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:16:41,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:41,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:16:41,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:41,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:41,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:41,948 INFO L130 PetriNetUnfolder]: 1317/2014 cut-off events. [2023-01-27 18:16:41,948 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-01-27 18:16:41,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4198 conditions, 2014 events. 1317/2014 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9444 event pairs, 419 based on Foata normal form. 70/2084 useless extension candidates. Maximal degree in co-relation 4188. Up to 1272 conditions per place. [2023-01-27 18:16:41,956 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-01-27 18:16:41,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 164 flow [2023-01-27 18:16:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:16:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:16:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-01-27 18:16:41,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-01-27 18:16:41,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-01-27 18:16:41,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-01-27 18:16:41,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:41,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-01-27 18:16:41,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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:16:41,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:41,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:41,970 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 296 transitions. [2023-01-27 18:16:41,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 164 flow [2023-01-27 18:16:41,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:41,972 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2023-01-27 18:16:41,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-01-27 18:16:41,973 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-01-27 18:16:41,973 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2023-01-27 18:16:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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:16:41,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:41,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:16:41,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:41,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 412876948, now seen corresponding path program 1 times [2023-01-27 18:16:41,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:41,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299041430] [2023-01-27 18:16:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:42,165 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:16:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299041430] [2023-01-27 18:16:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299041430] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:16:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722918901] [2023-01-27 18:16:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:42,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:42,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:42,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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:16:42,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:42,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:42,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:42,386 INFO L130 PetriNetUnfolder]: 1263/1933 cut-off events. [2023-01-27 18:16:42,387 INFO L131 PetriNetUnfolder]: For 827/827 co-relation queries the response was YES. [2023-01-27 18:16:42,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4983 conditions, 1933 events. 1263/1933 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8774 event pairs, 156 based on Foata normal form. 12/1945 useless extension candidates. Maximal degree in co-relation 4971. Up to 1103 conditions per place. [2023-01-27 18:16:42,394 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-27 18:16:42,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 264 flow [2023-01-27 18:16:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:16:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:16:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-01-27 18:16:42,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48625 [2023-01-27 18:16:42,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-01-27 18:16:42,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-01-27 18:16:42,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:42,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-01-27 18:16:42,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 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:16:42,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:42,398 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:42,398 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 4 states and 389 transitions. [2023-01-27 18:16:42,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 264 flow [2023-01-27 18:16:42,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:42,401 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 154 flow [2023-01-27 18:16:42,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-01-27 18:16:42,402 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-01-27 18:16:42,402 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 154 flow [2023-01-27 18:16:42,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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:16:42,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:42,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:42,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:16:42,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:42,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -87159557, now seen corresponding path program 1 times [2023-01-27 18:16:42,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:42,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68911024] [2023-01-27 18:16:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:42,522 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:16:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:42,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68911024] [2023-01-27 18:16:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68911024] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:16:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313153610] [2023-01-27 18:16:42,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:42,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:42,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:42,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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:16:42,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:42,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:42,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:42,716 INFO L130 PetriNetUnfolder]: 1214/1860 cut-off events. [2023-01-27 18:16:42,716 INFO L131 PetriNetUnfolder]: For 1554/1554 co-relation queries the response was YES. [2023-01-27 18:16:42,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 1860 events. 1214/1860 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8469 event pairs, 291 based on Foata normal form. 15/1875 useless extension candidates. Maximal degree in co-relation 5228. Up to 1069 conditions per place. [2023-01-27 18:16:42,726 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2023-01-27 18:16:42,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 352 flow [2023-01-27 18:16:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:16:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:16:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-01-27 18:16:42,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49125 [2023-01-27 18:16:42,727 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-01-27 18:16:42,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-01-27 18:16:42,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:42,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-01-27 18:16:42,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 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:16:42,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:42,730 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:42,730 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 154 flow. Second operand 4 states and 393 transitions. [2023-01-27 18:16:42,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 352 flow [2023-01-27 18:16:42,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:16:42,736 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 234 flow [2023-01-27 18:16:42,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-27 18:16:42,737 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-27 18:16:42,737 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 234 flow [2023-01-27 18:16:42,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 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:16:42,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:42,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:42,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:16:42,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:42,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:42,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1593055990, now seen corresponding path program 1 times [2023-01-27 18:16:42,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:42,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361024794] [2023-01-27 18:16:42,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:42,884 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:16:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361024794] [2023-01-27 18:16:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361024794] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:42,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:42,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645255583] [2023-01-27 18:16:42,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:42,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:42,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:42,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:42,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:42,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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:16:42,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:42,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:42,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:43,205 INFO L130 PetriNetUnfolder]: 1726/2663 cut-off events. [2023-01-27 18:16:43,206 INFO L131 PetriNetUnfolder]: For 4995/4995 co-relation queries the response was YES. [2023-01-27 18:16:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2663 events. 1726/2663 cut-off events. For 4995/4995 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13012 event pairs, 403 based on Foata normal form. 57/2720 useless extension candidates. Maximal degree in co-relation 8256. Up to 1211 conditions per place. [2023-01-27 18:16:43,219 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 41 selfloop transitions, 9 changer transitions 15/65 dead transitions. [2023-01-27 18:16:43,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 480 flow [2023-01-27 18:16:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:16:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:16:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2023-01-27 18:16:43,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2023-01-27 18:16:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions. [2023-01-27 18:16:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions. [2023-01-27 18:16:43,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:43,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions. [2023-01-27 18:16:43,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 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:16:43,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:43,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:43,224 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 234 flow. Second operand 5 states and 485 transitions. [2023-01-27 18:16:43,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 480 flow [2023-01-27 18:16:43,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:16:43,233 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 193 flow [2023-01-27 18:16:43,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-01-27 18:16:43,235 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2023-01-27 18:16:43,235 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 193 flow [2023-01-27 18:16:43,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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:16:43,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:43,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:43,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:16:43,236 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:43,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1869600855, now seen corresponding path program 1 times [2023-01-27 18:16:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849551618] [2023-01-27 18:16:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:43,359 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:16:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849551618] [2023-01-27 18:16:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849551618] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:16:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356180614] [2023-01-27 18:16:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:43,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:16:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:43,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:16:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:16:43,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-01-27 18:16:43,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:16:43,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:43,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-01-27 18:16:43,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:43,485 INFO L130 PetriNetUnfolder]: 835/1325 cut-off events. [2023-01-27 18:16:43,486 INFO L131 PetriNetUnfolder]: For 2773/2782 co-relation queries the response was YES. [2023-01-27 18:16:43,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 1325 events. 835/1325 cut-off events. For 2773/2782 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5919 event pairs, 321 based on Foata normal form. 9/1318 useless extension candidates. Maximal degree in co-relation 4363. Up to 1079 conditions per place. [2023-01-27 18:16:43,493 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 26 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-01-27 18:16:43,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 281 flow [2023-01-27 18:16:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:16:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:16:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-01-27 18:16:43,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2023-01-27 18:16:43,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-01-27 18:16:43,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-01-27 18:16:43,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:43,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-01-27 18:16:43,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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:16:43,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:43,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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:16:43,496 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 193 flow. Second operand 3 states and 303 transitions. [2023-01-27 18:16:43,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 281 flow [2023-01-27 18:16:43,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 217 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-01-27 18:16:43,501 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 146 flow [2023-01-27 18:16:43,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-01-27 18:16:43,501 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-01-27 18:16:43,502 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 146 flow [2023-01-27 18:16:43,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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:16:43,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:43,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:16:43,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:43,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1637706220, now seen corresponding path program 2 times [2023-01-27 18:16:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710791943] [2023-01-27 18:16:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:43,598 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:16:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710791943] [2023-01-27 18:16:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710791943] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349527588] [2023-01-27 18:16:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:43,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:43,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:43,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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:16:43,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:43,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:43,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:43,801 INFO L130 PetriNetUnfolder]: 1130/1740 cut-off events. [2023-01-27 18:16:43,802 INFO L131 PetriNetUnfolder]: For 1505/1505 co-relation queries the response was YES. [2023-01-27 18:16:43,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4810 conditions, 1740 events. 1130/1740 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7908 event pairs, 341 based on Foata normal form. 54/1794 useless extension candidates. Maximal degree in co-relation 4793. Up to 1074 conditions per place. [2023-01-27 18:16:43,806 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 33 selfloop transitions, 8 changer transitions 11/52 dead transitions. [2023-01-27 18:16:43,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 332 flow [2023-01-27 18:16:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:16:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:16:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2023-01-27 18:16:43,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477 [2023-01-27 18:16:43,808 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 477 transitions. [2023-01-27 18:16:43,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 477 transitions. [2023-01-27 18:16:43,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:43,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 477 transitions. [2023-01-27 18:16:43,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:16:43,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:43,810 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:43,810 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 146 flow. Second operand 5 states and 477 transitions. [2023-01-27 18:16:43,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 332 flow [2023-01-27 18:16:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:43,813 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 155 flow [2023-01-27 18:16:43,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-27 18:16:43,813 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-01-27 18:16:43,813 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 155 flow [2023-01-27 18:16:43,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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:16:43,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:43,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:43,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:16:43,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:43,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2123051309, now seen corresponding path program 1 times [2023-01-27 18:16:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:43,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914222775] [2023-01-27 18:16:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:43,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:16:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914222775] [2023-01-27 18:16:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914222775] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221576181] [2023-01-27 18:16:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:43,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:43,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-27 18:16:43,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 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:16:43,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:43,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-27 18:16:43,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:44,066 INFO L130 PetriNetUnfolder]: 490/761 cut-off events. [2023-01-27 18:16:44,066 INFO L131 PetriNetUnfolder]: For 952/952 co-relation queries the response was YES. [2023-01-27 18:16:44,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 761 events. 490/761 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2747 event pairs, 103 based on Foata normal form. 9/770 useless extension candidates. Maximal degree in co-relation 2390. Up to 442 conditions per place. [2023-01-27 18:16:44,069 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-01-27 18:16:44,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 251 flow [2023-01-27 18:16:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:16:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:16:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-01-27 18:16:44,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-01-27 18:16:44,071 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-01-27 18:16:44,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-01-27 18:16:44,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:44,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-01-27 18:16:44,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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:16:44,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:44,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 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:16:44,073 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 155 flow. Second operand 4 states and 376 transitions. [2023-01-27 18:16:44,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 251 flow [2023-01-27 18:16:44,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 228 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-01-27 18:16:44,075 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 148 flow [2023-01-27 18:16:44,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-01-27 18:16:44,076 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-27 18:16:44,076 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 148 flow [2023-01-27 18:16:44,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 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:16:44,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:44,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:44,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:16:44,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:44,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1390049791, now seen corresponding path program 1 times [2023-01-27 18:16:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246619406] [2023-01-27 18:16:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:44,186 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:16:44,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246619406] [2023-01-27 18:16:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246619406] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827482855] [2023-01-27 18:16:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:44,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:44,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-27 18:16:44,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 148 flow. Second operand has 4 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:16:44,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:44,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-27 18:16:44,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:44,320 INFO L130 PetriNetUnfolder]: 625/977 cut-off events. [2023-01-27 18:16:44,320 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES. [2023-01-27 18:16:44,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 977 events. 625/977 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3877 event pairs, 181 based on Foata normal form. 27/1004 useless extension candidates. Maximal degree in co-relation 2858. Up to 405 conditions per place. [2023-01-27 18:16:44,323 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 24 selfloop transitions, 2 changer transitions 22/48 dead transitions. [2023-01-27 18:16:44,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 296 flow [2023-01-27 18:16:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:16:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:16:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-01-27 18:16:44,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486 [2023-01-27 18:16:44,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-01-27 18:16:44,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-01-27 18:16:44,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:44,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-01-27 18:16:44,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:16:44,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:44,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:44,342 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 148 flow. Second operand 5 states and 486 transitions. [2023-01-27 18:16:44,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 296 flow [2023-01-27 18:16:44,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:16:44,344 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 88 flow [2023-01-27 18:16:44,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-01-27 18:16:44,344 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-27 18:16:44,344 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 88 flow [2023-01-27 18:16:44,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:16:44,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:44,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:44,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:16:44,345 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:44,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash 490125121, now seen corresponding path program 2 times [2023-01-27 18:16:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:44,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639651320] [2023-01-27 18:16:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:44,442 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:16:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639651320] [2023-01-27 18:16:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639651320] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:44,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:44,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:16:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814749809] [2023-01-27 18:16:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:16:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:16:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:16:44,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-27 18:16:44,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 20 transitions, 88 flow. Second operand has 4 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:16:44,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:44,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-27 18:16:44,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:44,525 INFO L130 PetriNetUnfolder]: 214/378 cut-off events. [2023-01-27 18:16:44,525 INFO L131 PetriNetUnfolder]: For 333/334 co-relation queries the response was YES. [2023-01-27 18:16:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 378 events. 214/378 cut-off events. For 333/334 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1446 event pairs, 42 based on Foata normal form. 40/417 useless extension candidates. Maximal degree in co-relation 1012. Up to 241 conditions per place. [2023-01-27 18:16:44,526 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 24 selfloop transitions, 4 changer transitions 18/48 dead transitions. [2023-01-27 18:16:44,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 274 flow [2023-01-27 18:16:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:16:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:16:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-01-27 18:16:44,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488 [2023-01-27 18:16:44,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-01-27 18:16:44,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-01-27 18:16:44,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:44,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-01-27 18:16:44,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:16:44,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:44,530 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 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:16:44,530 INFO L175 Difference]: Start difference. First operand has 44 places, 20 transitions, 88 flow. Second operand 5 states and 488 transitions. [2023-01-27 18:16:44,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 274 flow [2023-01-27 18:16:44,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 228 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-01-27 18:16:44,532 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 96 flow [2023-01-27 18:16:44,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-01-27 18:16:44,532 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-01-27 18:16:44,532 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 96 flow [2023-01-27 18:16:44,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:16:44,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:44,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:44,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:16:44,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:44,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash -998333636, now seen corresponding path program 1 times [2023-01-27 18:16:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947056517] [2023-01-27 18:16:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:44,650 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:16:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:44,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947056517] [2023-01-27 18:16:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947056517] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:16:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25414146] [2023-01-27 18:16:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:44,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:16:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:16:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:16:44,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-27 18:16:44,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 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:16:44,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:44,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-27 18:16:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:44,736 INFO L130 PetriNetUnfolder]: 100/203 cut-off events. [2023-01-27 18:16:44,736 INFO L131 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2023-01-27 18:16:44,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 203 events. 100/203 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 660 event pairs, 17 based on Foata normal form. 25/227 useless extension candidates. Maximal degree in co-relation 642. Up to 88 conditions per place. [2023-01-27 18:16:44,737 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 28 selfloop transitions, 7 changer transitions 16/53 dead transitions. [2023-01-27 18:16:44,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 320 flow [2023-01-27 18:16:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:16:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:16:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2023-01-27 18:16:44,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4841666666666667 [2023-01-27 18:16:44,739 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 581 transitions. [2023-01-27 18:16:44,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 581 transitions. [2023-01-27 18:16:44,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:44,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 581 transitions. [2023-01-27 18:16:44,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 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:16:44,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 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:16:44,742 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 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:16:44,742 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 96 flow. Second operand 6 states and 581 transitions. [2023-01-27 18:16:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 320 flow [2023-01-27 18:16:44,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:16:44,743 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 146 flow [2023-01-27 18:16:44,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-01-27 18:16:44,744 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-27 18:16:44,744 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 146 flow [2023-01-27 18:16:44,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 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:16:44,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:44,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:44,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:16:44,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:44,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1062997089, now seen corresponding path program 1 times [2023-01-27 18:16:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110424198] [2023-01-27 18:16:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:44,896 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:16:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110424198] [2023-01-27 18:16:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110424198] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:44,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837620909] [2023-01-27 18:16:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:44,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:16:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:16:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:16:44,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-27 18:16:44,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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:16:44,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:44,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-27 18:16:44,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:44,998 INFO L130 PetriNetUnfolder]: 54/120 cut-off events. [2023-01-27 18:16:44,999 INFO L131 PetriNetUnfolder]: For 156/157 co-relation queries the response was YES. [2023-01-27 18:16:44,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 120 events. 54/120 cut-off events. For 156/157 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 302 event pairs, 14 based on Foata normal form. 8/127 useless extension candidates. Maximal degree in co-relation 417. Up to 48 conditions per place. [2023-01-27 18:16:44,999 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 10 changer transitions 8/45 dead transitions. [2023-01-27 18:16:44,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 316 flow [2023-01-27 18:16:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:16:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:16:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-01-27 18:16:45,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47214285714285714 [2023-01-27 18:16:45,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-01-27 18:16:45,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-01-27 18:16:45,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:45,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-01-27 18:16:45,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 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:16:45,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 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:16:45,005 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 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:16:45,005 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 146 flow. Second operand 7 states and 661 transitions. [2023-01-27 18:16:45,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 316 flow [2023-01-27 18:16:45,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 263 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-01-27 18:16:45,007 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 140 flow [2023-01-27 18:16:45,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-27 18:16:45,008 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-01-27 18:16:45,008 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 140 flow [2023-01-27 18:16:45,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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:16:45,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:45,008 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:16:45,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:16:45,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:45,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 215029981, now seen corresponding path program 1 times [2023-01-27 18:16:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674488116] [2023-01-27 18:16:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:16:45,440 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:16:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:16:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674488116] [2023-01-27 18:16:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674488116] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:16:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:16:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:16:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290065379] [2023-01-27 18:16:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:16:45,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:16:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:16:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:16:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:16:45,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-01-27 18:16:45,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 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:16:45,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:16:45,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-01-27 18:16:45,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:16:45,552 INFO L130 PetriNetUnfolder]: 56/128 cut-off events. [2023-01-27 18:16:45,552 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-01-27 18:16:45,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 128 events. 56/128 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 5 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 432. Up to 45 conditions per place. [2023-01-27 18:16:45,553 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 3 changer transitions 23/53 dead transitions. [2023-01-27 18:16:45,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 403 flow [2023-01-27 18:16:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:16:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:16:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-01-27 18:16:45,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46214285714285713 [2023-01-27 18:16:45,554 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-01-27 18:16:45,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-01-27 18:16:45,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:16:45,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-01-27 18:16:45,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 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:16:45,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 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:16:45,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 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:16:45,558 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 140 flow. Second operand 7 states and 647 transitions. [2023-01-27 18:16:45,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 403 flow [2023-01-27 18:16:45,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 321 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-01-27 18:16:45,559 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 116 flow [2023-01-27 18:16:45,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-01-27 18:16:45,559 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-27 18:16:45,560 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 116 flow [2023-01-27 18:16:45,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 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:16:45,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:16:45,560 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:16:45,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:16:45,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:16:45,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:16:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1689701431, now seen corresponding path program 2 times [2023-01-27 18:16:45,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:16:45,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949472216] [2023-01-27 18:16:45,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:16:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:16:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:45,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:16:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:16:45,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:16:45,664 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:16:45,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:16:45,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:16:45,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:16:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:16:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:16:45,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:16:45,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:16:45,667 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:16:45,673 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:16:45,673 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:16:45,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:16:45 BasicIcfg [2023-01-27 18:16:45,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:16:45,728 INFO L158 Benchmark]: Toolchain (without parser) took 8856.39ms. Allocated memory was 329.3MB in the beginning and 572.5MB in the end (delta: 243.3MB). Free memory was 298.0MB in the beginning and 251.5MB in the end (delta: 46.4MB). Peak memory consumption was 292.4MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,728 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:16:45,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 329.3MB. Free memory was 298.0MB in the beginning and 275.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.81ms. Allocated memory is still 329.3MB. Free memory was 275.0MB in the beginning and 272.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,731 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 329.3MB. Free memory was 272.5MB in the beginning and 270.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,731 INFO L158 Benchmark]: RCFGBuilder took 543.67ms. Allocated memory is still 329.3MB. Free memory was 270.9MB in the beginning and 236.4MB in the end (delta: 34.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,731 INFO L158 Benchmark]: TraceAbstraction took 7828.89ms. Allocated memory was 329.3MB in the beginning and 572.5MB in the end (delta: 243.3MB). Free memory was 235.6MB in the beginning and 251.5MB in the end (delta: -15.9MB). Peak memory consumption was 229.5MB. Max. memory is 16.0GB. [2023-01-27 18:16:45,732 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 329.3MB. Free memory was 298.0MB in the beginning and 275.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.81ms. Allocated memory is still 329.3MB. Free memory was 275.0MB in the beginning and 272.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 329.3MB. Free memory was 272.5MB in the beginning and 270.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 543.67ms. Allocated memory is still 329.3MB. Free memory was 270.9MB in the beginning and 236.4MB in the end (delta: 34.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 7828.89ms. Allocated memory was 329.3MB in the beginning and 572.5MB in the end (delta: 243.3MB). Free memory was 235.6MB in the beginning and 251.5MB in the end (delta: -15.9MB). Peak memory consumption was 229.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 112 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2102, independent: 1934, independent conditional: 0, independent unconditional: 1934, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1011, independent: 966, independent conditional: 0, independent unconditional: 966, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2102, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1011, unknown conditional: 0, unknown unconditional: 1011] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-1, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=0, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=1, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: 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: 830]: 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: 832]: 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: 834]: 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, 133 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: 7.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 15 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 61, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:16:45,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...