/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:43:23,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:43:23,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:43:23,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:43:23,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:43:23,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:43:23,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:43:23,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:43:23,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:43:23,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:43:23,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:43:23,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:43:23,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:43:23,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:43:23,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:43:23,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:43:23,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:43:23,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:43:23,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:43:23,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:43:23,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:43:23,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:43:23,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:43:23,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:43:23,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:43:23,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:43:23,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:43:23,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:43:23,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:43:23,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:43:23,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:43:23,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:43:23,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:43:23,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:43:23,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:43:23,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:43:23,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:43:23,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:43:23,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:43:23,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:43:23,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:43:23,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:43:23,577 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:43:23,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:43:23,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:43:23,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:43:23,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:43:23,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:43:23,579 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:43:23,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:43:23,579 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:43:23,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:43:23,580 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:43:23,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:23,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:43:23,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:43:23,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:43:23,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:43:23,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:43:23,582 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:43:23,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:43:23,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:43:23,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:43:23,782 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:43:23,782 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:43:23,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-01-28 00:43:24,703 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:43:24,917 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:43:24,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-01-28 00:43:24,927 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d620675b/1853bc09f957480d89c0afd306da2e88/FLAGb339a749f [2023-01-28 00:43:24,939 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d620675b/1853bc09f957480d89c0afd306da2e88 [2023-01-28 00:43:24,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:43:24,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:43:24,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:24,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:43:24,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:43:24,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:24" (1/1) ... [2023-01-28 00:43:24,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c801bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:24, skipping insertion in model container [2023-01-28 00:43:24,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:24" (1/1) ... [2023-01-28 00:43:24,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:43:24,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:43:25,074 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2023-01-28 00:43:25,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:25,204 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:43:25,212 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/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2023-01-28 00:43:25,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:25,283 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:25,284 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:25,288 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:43:25,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25 WrapperNode [2023-01-28 00:43:25,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:25,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:25,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:43:25,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:43:25,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,345 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-01-28 00:43:25,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:25,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:43:25,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:43:25,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:43:25,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,371 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:43:25,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:43:25,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:43:25,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:43:25,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (1/1) ... [2023-01-28 00:43:25,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:25,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:43:25,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:43:25,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:43:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:43:25,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:43:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:43:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:43:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:43:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:43:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:43:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:43:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:43:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:43:25,439 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:43:25,580 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:43:25,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:43:25,832 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:43:25,927 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:43:25,927 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:43:25,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:25 BoogieIcfgContainer [2023-01-28 00:43:25,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:43:25,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:43:25,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:43:25,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:43:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:43:24" (1/3) ... [2023-01-28 00:43:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c673f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:25, skipping insertion in model container [2023-01-28 00:43:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:25" (2/3) ... [2023-01-28 00:43:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c673f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:25, skipping insertion in model container [2023-01-28 00:43:25,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:25" (3/3) ... [2023-01-28 00:43:25,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2023-01-28 00:43:25,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:43:25,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:43:25,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:43:25,993 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:43:26,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:43:26,069 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:43:26,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:26,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 00:43:26,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-01-28 00:43:26,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-01-28 00:43:26,079 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:43:26,085 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:43:26,087 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-01-28 00:43:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-01-28 00:43:26,110 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-01-28 00:43:26,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:26,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-28 00:43:26,113 INFO L119 LiptonReduction]: Number of co-enabled transitions 1676 [2023-01-28 00:43:28,707 INFO L134 LiptonReduction]: Checked pairs total: 3725 [2023-01-28 00:43:28,708 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 00:43:28,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:43:28,729 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;@7726cc2b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:43:28,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:43:28,732 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-01-28 00:43:28,732 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:28,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:28,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:28,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:28,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2103164429, now seen corresponding path program 1 times [2023-01-28 00:43:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497483299] [2023-01-28 00:43:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497483299] [2023-01-28 00:43:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497483299] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:29,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:43:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236913495] [2023-01-28 00:43:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:29,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:43:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:29,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:43:29,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:43:29,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-01-28 00:43:29,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:29,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-01-28 00:43:29,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:29,215 INFO L130 PetriNetUnfolder]: 511/843 cut-off events. [2023-01-28 00:43:29,216 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-01-28 00:43:29,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 843 events. 511/843 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3847 event pairs, 112 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1651. Up to 580 conditions per place. [2023-01-28 00:43:29,224 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-01-28 00:43:29,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2023-01-28 00:43:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-01-28 00:43:29,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-01-28 00:43:29,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-01-28 00:43:29,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-01-28 00:43:29,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:29,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-01-28 00:43:29,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,250 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-28 00:43:29,251 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-28 00:43:29,252 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 3 states and 312 transitions. [2023-01-28 00:43:29,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2023-01-28 00:43:29,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:43:29,255 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-01-28 00:43:29,256 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-01-28 00:43:29,258 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-01-28 00:43:29,259 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-01-28 00:43:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:29,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:29,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:43:29,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:29,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1788631708, now seen corresponding path program 1 times [2023-01-28 00:43:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552387270] [2023-01-28 00:43:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:29,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:29,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552387270] [2023-01-28 00:43:29,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552387270] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:29,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:29,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:43:29,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865820645] [2023-01-28 00:43:29,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:29,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:43:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:43:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:43:29,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-28 00:43:29,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:29,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-28 00:43:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:29,584 INFO L130 PetriNetUnfolder]: 919/1428 cut-off events. [2023-01-28 00:43:29,585 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-01-28 00:43:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1428 events. 919/1428 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6407 event pairs, 299 based on Foata normal form. 44/1472 useless extension candidates. Maximal degree in co-relation 2988. Up to 981 conditions per place. [2023-01-28 00:43:29,590 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-01-28 00:43:29,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 146 flow [2023-01-28 00:43:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-01-28 00:43:29,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-01-28 00:43:29,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-01-28 00:43:29,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-01-28 00:43:29,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:29,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-01-28 00:43:29,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,594 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-28 00:43:29,594 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-28 00:43:29,594 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 298 transitions. [2023-01-28 00:43:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 146 flow [2023-01-28 00:43:29,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:29,596 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 82 flow [2023-01-28 00:43:29,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-01-28 00:43:29,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-01-28 00:43:29,597 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 82 flow [2023-01-28 00:43:29,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:29,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:29,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:43:29,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:29,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -386992698, now seen corresponding path program 1 times [2023-01-28 00:43:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46938995] [2023-01-28 00:43:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:29,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46938995] [2023-01-28 00:43:29,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46938995] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:29,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:29,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830544342] [2023-01-28 00:43:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:29,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:29,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:29,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-28 00:43:29,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 82 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-28 00:43:29,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:29,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-28 00:43:29,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:29,912 INFO L130 PetriNetUnfolder]: 581/992 cut-off events. [2023-01-28 00:43:29,912 INFO L131 PetriNetUnfolder]: For 365/365 co-relation queries the response was YES. [2023-01-28 00:43:29,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 992 events. 581/992 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4930 event pairs, 108 based on Foata normal form. 92/1061 useless extension candidates. Maximal degree in co-relation 2389. Up to 617 conditions per place. [2023-01-28 00:43:29,916 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 37 selfloop transitions, 7 changer transitions 10/58 dead transitions. [2023-01-28 00:43:29,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 300 flow [2023-01-28 00:43:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:43:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:43:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-01-28 00:43:29,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478 [2023-01-28 00:43:29,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-01-28 00:43:29,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-01-28 00:43:29,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:29,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-01-28 00:43:29,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:29,921 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-28 00:43:29,922 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-28 00:43:29,922 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 82 flow. Second operand 5 states and 478 transitions. [2023-01-28 00:43:29,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 300 flow [2023-01-28 00:43:29,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:29,925 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 126 flow [2023-01-28 00:43:29,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-01-28 00:43:29,926 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-01-28 00:43:29,928 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 126 flow [2023-01-28 00:43:29,928 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-28 00:43:29,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:29,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:29,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:43:29,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:29,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 809441041, now seen corresponding path program 1 times [2023-01-28 00:43:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887945277] [2023-01-28 00:43:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887945277] [2023-01-28 00:43:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887945277] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311669009] [2023-01-28 00:43:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:30,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:30,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-28 00:43:30,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 126 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-28 00:43:30,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:30,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-28 00:43:30,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:30,244 INFO L130 PetriNetUnfolder]: 414/752 cut-off events. [2023-01-28 00:43:30,244 INFO L131 PetriNetUnfolder]: For 516/533 co-relation queries the response was YES. [2023-01-28 00:43:30,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 752 events. 414/752 cut-off events. For 516/533 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3751 event pairs, 46 based on Foata normal form. 72/808 useless extension candidates. Maximal degree in co-relation 2315. Up to 273 conditions per place. [2023-01-28 00:43:30,247 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 45 selfloop transitions, 13 changer transitions 18/80 dead transitions. [2023-01-28 00:43:30,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 464 flow [2023-01-28 00:43:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:43:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:43:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-01-28 00:43:30,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47714285714285715 [2023-01-28 00:43:30,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-01-28 00:43:30,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-01-28 00:43:30,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:30,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-01-28 00:43:30,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,258 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-28 00:43:30,259 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-28 00:43:30,259 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 126 flow. Second operand 7 states and 668 transitions. [2023-01-28 00:43:30,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 80 transitions, 464 flow [2023-01-28 00:43:30,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:43:30,264 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 210 flow [2023-01-28 00:43:30,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-01-28 00:43:30,265 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-01-28 00:43:30,265 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 210 flow [2023-01-28 00:43:30,266 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-28 00:43:30,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:30,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:30,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:43:30,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:30,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1973203494, now seen corresponding path program 1 times [2023-01-28 00:43:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78657692] [2023-01-28 00:43:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78657692] [2023-01-28 00:43:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78657692] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:43:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883091019] [2023-01-28 00:43:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:30,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:30,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-28 00:43:30,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:30,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-28 00:43:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:30,568 INFO L130 PetriNetUnfolder]: 364/666 cut-off events. [2023-01-28 00:43:30,568 INFO L131 PetriNetUnfolder]: For 1158/1171 co-relation queries the response was YES. [2023-01-28 00:43:30,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 666 events. 364/666 cut-off events. For 1158/1171 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3289 event pairs, 40 based on Foata normal form. 29/680 useless extension candidates. Maximal degree in co-relation 2365. Up to 237 conditions per place. [2023-01-28 00:43:30,571 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 41 selfloop transitions, 17 changer transitions 18/80 dead transitions. [2023-01-28 00:43:30,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 522 flow [2023-01-28 00:43:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:43:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:43:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 840 transitions. [2023-01-28 00:43:30,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-01-28 00:43:30,573 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 840 transitions. [2023-01-28 00:43:30,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 840 transitions. [2023-01-28 00:43:30,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:30,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 840 transitions. [2023-01-28 00:43:30,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.33333333333333) internal successors, (840), 9 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,578 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,578 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 210 flow. Second operand 9 states and 840 transitions. [2023-01-28 00:43:30,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 522 flow [2023-01-28 00:43:30,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 492 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:30,586 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2023-01-28 00:43:30,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-01-28 00:43:30,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-01-28 00:43:30,587 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2023-01-28 00:43:30,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:30,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:30,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:43:30,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:30,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1453504311, now seen corresponding path program 1 times [2023-01-28 00:43:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732959649] [2023-01-28 00:43:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732959649] [2023-01-28 00:43:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732959649] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026647168] [2023-01-28 00:43:30,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:30,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:30,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-28 00:43:30,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:30,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-28 00:43:30,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:30,947 INFO L130 PetriNetUnfolder]: 539/968 cut-off events. [2023-01-28 00:43:30,948 INFO L131 PetriNetUnfolder]: For 2021/2021 co-relation queries the response was YES. [2023-01-28 00:43:30,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 968 events. 539/968 cut-off events. For 2021/2021 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4916 event pairs, 61 based on Foata normal form. 1/969 useless extension candidates. Maximal degree in co-relation 3592. Up to 463 conditions per place. [2023-01-28 00:43:30,951 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 44 selfloop transitions, 11 changer transitions 31/86 dead transitions. [2023-01-28 00:43:30,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 730 flow [2023-01-28 00:43:30,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:43:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:43:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-01-28 00:43:30,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.482 [2023-01-28 00:43:30,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-01-28 00:43:30,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-01-28 00:43:30,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:30,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-01-28 00:43:30,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,955 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-28 00:43:30,955 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-28 00:43:30,955 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 5 states and 482 transitions. [2023-01-28 00:43:30,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 730 flow [2023-01-28 00:43:30,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 8 redundant places. [2023-01-28 00:43:30,965 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 208 flow [2023-01-28 00:43:30,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-01-28 00:43:30,966 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2023-01-28 00:43:30,967 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 208 flow [2023-01-28 00:43:30,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:30,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:30,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:30,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:43:30,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:30,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1417083869, now seen corresponding path program 2 times [2023-01-28 00:43:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603798037] [2023-01-28 00:43:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603798037] [2023-01-28 00:43:31,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603798037] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920766779] [2023-01-28 00:43:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:31,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:31,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-01-28 00:43:31,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:31,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-01-28 00:43:31,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:31,260 INFO L130 PetriNetUnfolder]: 290/551 cut-off events. [2023-01-28 00:43:31,260 INFO L131 PetriNetUnfolder]: For 872/872 co-relation queries the response was YES. [2023-01-28 00:43:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 551 events. 290/551 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2463 event pairs, 32 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 2077. Up to 199 conditions per place. [2023-01-28 00:43:31,262 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 33 selfloop transitions, 7 changer transitions 42/82 dead transitions. [2023-01-28 00:43:31,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 606 flow [2023-01-28 00:43:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:43:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:43:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-01-28 00:43:31,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-01-28 00:43:31,264 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-01-28 00:43:31,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-01-28 00:43:31,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:31,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-01-28 00:43:31,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,267 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-28 00:43:31,267 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-28 00:43:31,267 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 208 flow. Second operand 6 states and 575 transitions. [2023-01-28 00:43:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 606 flow [2023-01-28 00:43:31,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 82 transitions, 582 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-01-28 00:43:31,270 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 170 flow [2023-01-28 00:43:31,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-01-28 00:43:31,271 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-01-28 00:43:31,271 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 170 flow [2023-01-28 00:43:31,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:31,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:43:31,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:31,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1230072947, now seen corresponding path program 3 times [2023-01-28 00:43:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077814304] [2023-01-28 00:43:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077814304] [2023-01-28 00:43:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077814304] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983545624] [2023-01-28 00:43:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:31,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:31,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-01-28 00:43:31,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:31,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-01-28 00:43:31,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:31,528 INFO L130 PetriNetUnfolder]: 155/311 cut-off events. [2023-01-28 00:43:31,529 INFO L131 PetriNetUnfolder]: For 622/622 co-relation queries the response was YES. [2023-01-28 00:43:31,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 311 events. 155/311 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1229 event pairs, 42 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1206. Up to 162 conditions per place. [2023-01-28 00:43:31,532 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 26 selfloop transitions, 4 changer transitions 17/47 dead transitions. [2023-01-28 00:43:31,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 340 flow [2023-01-28 00:43:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2023-01-28 00:43:31,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2023-01-28 00:43:31,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 388 transitions. [2023-01-28 00:43:31,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 388 transitions. [2023-01-28 00:43:31,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:31,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 388 transitions. [2023-01-28 00:43:31,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,536 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-28 00:43:31,536 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-28 00:43:31,536 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 170 flow. Second operand 4 states and 388 transitions. [2023-01-28 00:43:31,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 340 flow [2023-01-28 00:43:31,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 302 flow, removed 4 selfloop flow, removed 9 redundant places. [2023-01-28 00:43:31,539 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 124 flow [2023-01-28 00:43:31,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2023-01-28 00:43:31,541 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2023-01-28 00:43:31,542 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 124 flow [2023-01-28 00:43:31,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:31,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:31,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:43:31,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:43:31,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 899835037, now seen corresponding path program 4 times [2023-01-28 00:43:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199219808] [2023-01-28 00:43:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:31,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:43:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:43:31,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:43:31,620 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:43:31,620 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:43:31,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:43:31,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:43:31,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:43:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:43:31,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:43:31,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:43:31,624 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-01-28 00:43:31,628 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:43:31,628 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:43:31,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:43:31 BasicIcfg [2023-01-28 00:43:31,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:43:31,685 INFO L158 Benchmark]: Toolchain (without parser) took 6743.56ms. Allocated memory was 402.7MB in the beginning and 583.0MB in the end (delta: 180.4MB). Free memory was 369.9MB in the beginning and 431.5MB in the end (delta: -61.5MB). Peak memory consumption was 120.2MB. Max. memory is 16.0GB. [2023-01-28 00:43:31,685 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:43:31,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.96ms. Allocated memory is still 402.7MB. Free memory was 369.9MB in the beginning and 347.4MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 00:43:31,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.38ms. Allocated memory is still 402.7MB. Free memory was 347.4MB in the beginning and 344.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:43:31,686 INFO L158 Benchmark]: Boogie Preprocessor took 28.51ms. Allocated memory is still 402.7MB. Free memory was 344.8MB in the beginning and 343.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:43:31,686 INFO L158 Benchmark]: RCFGBuilder took 554.94ms. Allocated memory is still 402.7MB. Free memory was 343.2MB in the beginning and 312.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-01-28 00:43:31,686 INFO L158 Benchmark]: TraceAbstraction took 5752.26ms. Allocated memory was 402.7MB in the beginning and 583.0MB in the end (delta: 180.4MB). Free memory was 311.7MB in the beginning and 431.5MB in the end (delta: -119.8MB). Peak memory consumption was 63.6MB. Max. memory is 16.0GB. [2023-01-28 00:43:31,687 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 346.96ms. Allocated memory is still 402.7MB. Free memory was 369.9MB in the beginning and 347.4MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.38ms. Allocated memory is still 402.7MB. Free memory was 347.4MB in the beginning and 344.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.51ms. Allocated memory is still 402.7MB. Free memory was 344.8MB in the beginning and 343.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 554.94ms. Allocated memory is still 402.7MB. Free memory was 343.2MB in the beginning and 312.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 5752.26ms. Allocated memory was 402.7MB in the beginning and 583.0MB in the end (delta: 180.4MB). Free memory was 311.7MB in the beginning and 431.5MB in the end (delta: -119.8MB). Peak memory consumption was 63.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 111 PlacesBefore, 31 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 3725 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1971, independent: 1840, independent conditional: 0, independent unconditional: 1840, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 936, independent: 903, independent conditional: 0, independent unconditional: 903, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1971, independent: 937, independent conditional: 0, independent unconditional: 937, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 936, unknown conditional: 0, unknown unconditional: 936] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-2, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=-1, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 9 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=5, InterpolantAutomatonStates: 42, 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.2s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:43:31,710 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...