/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 AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:51:29,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:51:29,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:51:29,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:51:29,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:51:29,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:51:29,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:51:29,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:51:29,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:51:29,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:51:29,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:51:29,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:51:29,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:51:29,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:51:29,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:51:29,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:51:29,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:51:29,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:51:29,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:51:29,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:51:29,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:51:29,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:51:29,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:51:29,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:51:29,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:51:29,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:51:29,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:51:29,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:51:29,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:51:29,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:51:29,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:51:29,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:51:29,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:51:29,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:51:29,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:51:29,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:51:29,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:51:29,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:51:29,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:51:29,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:51:29,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:51:29,644 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 06:51:29,659 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:51:29,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:51:29,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:51:29,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:51:29,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:51:29,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:51:29,660 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:51:29,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:51:29,663 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:51:29,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:51:29,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:51:29,664 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:51:29,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:51:29,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:51:29,665 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 -> AFTER [2023-01-28 06:51:29,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:51:29,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:51:29,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:51:29,883 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:51:29,883 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:51:29,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-01-28 06:51:30,758 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:51:31,020 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:51:31,020 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2023-01-28 06:51:31,037 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a9e0dcf/30ffc6e01ec047998ba29a6a34ebc83a/FLAGd38295b79 [2023-01-28 06:51:31,049 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a9e0dcf/30ffc6e01ec047998ba29a6a34ebc83a [2023-01-28 06:51:31,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:51:31,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:51:31,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:51:31,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:51:31,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:51:31,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3b21c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31, skipping insertion in model container [2023-01-28 06:51:31,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:51:31,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:51:31,243 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/mix020.oepc.i[945,958] [2023-01-28 06:51:31,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:51:31,416 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:51:31,423 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/mix020.oepc.i[945,958] [2023-01-28 06:51:31,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:51:31,514 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:51:31,514 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:51:31,519 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:51:31,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31 WrapperNode [2023-01-28 06:51:31,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:51:31,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:51:31,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:51:31,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:51:31,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,559 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 06:51:31,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:51:31,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:51:31,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:51:31,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:51:31,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,579 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:51:31,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:51:31,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:51:31,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:51:31,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (1/1) ... [2023-01-28 06:51:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:51:31,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:51:31,636 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 06:51:31,647 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 06:51:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:51:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:51:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:51:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:51:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:51:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:51:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:51:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:51:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:51:31,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:51:31,669 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 06:51:31,759 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:51:31,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:51:32,128 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:51:32,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:51:32,240 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:51:32,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:51:32 BoogieIcfgContainer [2023-01-28 06:51:32,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:51:32,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:51:32,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:51:32,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:51:32,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:51:31" (1/3) ... [2023-01-28 06:51:32,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a71d321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:51:32, skipping insertion in model container [2023-01-28 06:51:32,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:51:31" (2/3) ... [2023-01-28 06:51:32,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a71d321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:51:32, skipping insertion in model container [2023-01-28 06:51:32,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:51:32" (3/3) ... [2023-01-28 06:51:32,250 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2023-01-28 06:51:32,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:51:32,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:51:32,263 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:51:32,303 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:51:32,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 06:51:32,368 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 06:51:32,368 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:51:32,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-28 06:51:32,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-01-28 06:51:32,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-01-28 06:51:32,383 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:51:32,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 06:51:32,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-01-28 06:51:32,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-01-28 06:51:32,424 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-01-28 06:51:32,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:51:32,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-01-28 06:51:32,428 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-01-28 06:51:36,014 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-01-28 06:51:36,014 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-01-28 06:51:36,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:51:36,031 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;@c9280ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:51:36,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:51:36,033 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:51:36,033 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:51:36,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:36,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:51:36,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:36,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-01-28 06:51:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045695774] [2023-01-28 06:51:36,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:36,344 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 06:51:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:36,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045695774] [2023-01-28 06:51:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045695774] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:36,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:36,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:51:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266628290] [2023-01-28 06:51:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:36,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:51:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:36,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:51:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:51:36,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-01-28 06:51:36,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 06:51:36,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:36,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-01-28 06:51:36,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:37,135 INFO L130 PetriNetUnfolder]: 4903/7131 cut-off events. [2023-01-28 06:51:37,135 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-28 06:51:37,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-01-28 06:51:37,169 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-01-28 06:51:37,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-01-28 06:51:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:51:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:51:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-01-28 06:51:37,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-01-28 06:51:37,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-01-28 06:51:37,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-01-28 06:51:37,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:37,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-01-28 06:51:37,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:37,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:37,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:37,240 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-01-28 06:51:37,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-01-28 06:51:37,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:51:37,245 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 06:51:37,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-28 06:51:37,248 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:51:37,249 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 06:51:37,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 06:51:37,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:37,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:51:37,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:37,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-01-28 06:51:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484981623] [2023-01-28 06:51:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:37,596 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 06:51:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484981623] [2023-01-28 06:51:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484981623] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:51:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393104261] [2023-01-28 06:51:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:37,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:51:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:37,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:51:37,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:51:37,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 06:51:37,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:37,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:37,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 06:51:37,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:38,997 INFO L130 PetriNetUnfolder]: 14423/19622 cut-off events. [2023-01-28 06:51:38,998 INFO L131 PetriNetUnfolder]: For 1011/1011 co-relation queries the response was YES. [2023-01-28 06:51:39,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40728 conditions, 19622 events. 14423/19622 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 101399 event pairs, 5141 based on Foata normal form. 458/20080 useless extension candidates. Maximal degree in co-relation 40718. Up to 13627 conditions per place. [2023-01-28 06:51:39,064 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-01-28 06:51:39,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-01-28 06:51:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:51:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:51:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-01-28 06:51:39,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103734439834025 [2023-01-28 06:51:39,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-01-28 06:51:39,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-01-28 06:51:39,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:39,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-01-28 06:51:39,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 06:51:39,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:39,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:39,068 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 369 transitions. [2023-01-28 06:51:39,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-01-28 06:51:39,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:39,070 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-01-28 06:51:39,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-01-28 06:51:39,070 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-01-28 06:51:39,071 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-01-28 06:51:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:39,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:39,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:51:39,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:39,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1301725907, now seen corresponding path program 1 times [2023-01-28 06:51:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13579601] [2023-01-28 06:51:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:39,335 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 06:51:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13579601] [2023-01-28 06:51:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13579601] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:39,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:39,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:51:39,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407775029] [2023-01-28 06:51:39,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:39,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:51:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:51:39,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:51:39,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 241 [2023-01-28 06:51:39,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 06:51:39,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:39,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 241 [2023-01-28 06:51:39,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:40,526 INFO L130 PetriNetUnfolder]: 10516/14819 cut-off events. [2023-01-28 06:51:40,526 INFO L131 PetriNetUnfolder]: For 3592/3662 co-relation queries the response was YES. [2023-01-28 06:51:40,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34108 conditions, 14819 events. 10516/14819 cut-off events. For 3592/3662 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 81381 event pairs, 3566 based on Foata normal form. 202/14807 useless extension candidates. Maximal degree in co-relation 34096. Up to 10028 conditions per place. [2023-01-28 06:51:40,594 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 37 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-01-28 06:51:40,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 228 flow [2023-01-28 06:51:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:51:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:51:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-01-28 06:51:40,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200553250345782 [2023-01-28 06:51:40,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-01-28 06:51:40,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-01-28 06:51:40,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:40,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-01-28 06:51:40,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:40,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:40,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:40,598 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 3 states and 376 transitions. [2023-01-28 06:51:40,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 228 flow [2023-01-28 06:51:40,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:40,613 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 115 flow [2023-01-28 06:51:40,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-01-28 06:51:40,614 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-01-28 06:51:40,614 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 115 flow [2023-01-28 06:51:40,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 06:51:40,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:40,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:40,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:51:40,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:40,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1732554692, now seen corresponding path program 1 times [2023-01-28 06:51:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723221201] [2023-01-28 06:51:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:40,749 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 06:51:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723221201] [2023-01-28 06:51:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723221201] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:51:40,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627287177] [2023-01-28 06:51:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:40,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 06:51:40,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 06:51:40,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:40,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 06:51:40,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:41,914 INFO L130 PetriNetUnfolder]: 13066/17797 cut-off events. [2023-01-28 06:51:41,915 INFO L131 PetriNetUnfolder]: For 4039/4039 co-relation queries the response was YES. [2023-01-28 06:51:41,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42800 conditions, 17797 events. 13066/17797 cut-off events. For 4039/4039 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 91338 event pairs, 1897 based on Foata normal form. 40/17837 useless extension candidates. Maximal degree in co-relation 42787. Up to 11755 conditions per place. [2023-01-28 06:51:41,983 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 60 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2023-01-28 06:51:41,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 361 flow [2023-01-28 06:51:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:51:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:51:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-01-28 06:51:41,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062240663900415 [2023-01-28 06:51:41,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-01-28 06:51:41,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-01-28 06:51:41,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:41,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-01-28 06:51:41,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:41,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 06:51:41,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 06:51:41,993 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 115 flow. Second operand 4 states and 488 transitions. [2023-01-28 06:51:41,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 361 flow [2023-01-28 06:51:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:41,996 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 173 flow [2023-01-28 06:51:41,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-28 06:51:41,997 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-01-28 06:51:41,997 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 173 flow [2023-01-28 06:51:41,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 06:51:41,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:41,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:41,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:51:41,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:41,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2125427254, now seen corresponding path program 1 times [2023-01-28 06:51:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647838172] [2023-01-28 06:51:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:42,308 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 06:51:42,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647838172] [2023-01-28 06:51:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647838172] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:51:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645844742] [2023-01-28 06:51:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:42,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:42,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 06:51:42,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:51:42,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:42,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 06:51:42,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:43,341 INFO L130 PetriNetUnfolder]: 8218/12181 cut-off events. [2023-01-28 06:51:43,341 INFO L131 PetriNetUnfolder]: For 4745/5173 co-relation queries the response was YES. [2023-01-28 06:51:43,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29516 conditions, 12181 events. 8218/12181 cut-off events. For 4745/5173 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 75562 event pairs, 1579 based on Foata normal form. 1084/12959 useless extension candidates. Maximal degree in co-relation 29501. Up to 5128 conditions per place. [2023-01-28 06:51:43,430 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 61 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-01-28 06:51:43,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 433 flow [2023-01-28 06:51:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:51:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:51:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-01-28 06:51:43,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093360995850622 [2023-01-28 06:51:43,432 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-01-28 06:51:43,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-01-28 06:51:43,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:43,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-01-28 06:51:43,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 06:51:43,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 06:51:43,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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 06:51:43,435 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 173 flow. Second operand 4 states and 491 transitions. [2023-01-28 06:51:43,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 433 flow [2023-01-28 06:51:43,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:51:43,444 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 219 flow [2023-01-28 06:51:43,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-01-28 06:51:43,445 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-01-28 06:51:43,445 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 219 flow [2023-01-28 06:51:43,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:51:43,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:43,446 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 06:51:43,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:51:43,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:43,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -610326963, now seen corresponding path program 1 times [2023-01-28 06:51:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514199504] [2023-01-28 06:51:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:43,671 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 06:51:43,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:43,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514199504] [2023-01-28 06:51:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514199504] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:51:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342929349] [2023-01-28 06:51:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:51:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:43,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:51:43,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:51:43,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-28 06:51:43,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 06:51:43,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:43,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-28 06:51:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:45,101 INFO L130 PetriNetUnfolder]: 14565/20664 cut-off events. [2023-01-28 06:51:45,101 INFO L131 PetriNetUnfolder]: For 19121/19121 co-relation queries the response was YES. [2023-01-28 06:51:45,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64115 conditions, 20664 events. 14565/20664 cut-off events. For 19121/19121 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 119601 event pairs, 776 based on Foata normal form. 204/20868 useless extension candidates. Maximal degree in co-relation 64096. Up to 9179 conditions per place. [2023-01-28 06:51:45,204 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 85 selfloop transitions, 23 changer transitions 4/112 dead transitions. [2023-01-28 06:51:45,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 738 flow [2023-01-28 06:51:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:51:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:51:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-01-28 06:51:45,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954356846473029 [2023-01-28 06:51:45,206 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-01-28 06:51:45,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-01-28 06:51:45,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:45,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-01-28 06:51:45,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states 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 06:51:45,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 06:51:45,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 06:51:45,209 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 219 flow. Second operand 5 states and 597 transitions. [2023-01-28 06:51:45,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 738 flow [2023-01-28 06:51:45,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:51:45,241 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 385 flow [2023-01-28 06:51:45,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-01-28 06:51:45,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-01-28 06:51:45,243 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 385 flow [2023-01-28 06:51:45,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 06:51:45,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:45,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:51:45,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:45,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -787217133, now seen corresponding path program 1 times [2023-01-28 06:51:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:45,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335206559] [2023-01-28 06:51:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:45,379 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 06:51:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:45,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335206559] [2023-01-28 06:51:45,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335206559] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:45,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:51:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443596126] [2023-01-28 06:51:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:45,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:51:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:51:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:51:45,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-01-28 06:51:45,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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 06:51:45,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:45,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-01-28 06:51:45,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:46,553 INFO L130 PetriNetUnfolder]: 11045/16620 cut-off events. [2023-01-28 06:51:46,554 INFO L131 PetriNetUnfolder]: For 24249/25302 co-relation queries the response was YES. [2023-01-28 06:51:46,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53098 conditions, 16620 events. 11045/16620 cut-off events. For 24249/25302 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 107006 event pairs, 4607 based on Foata normal form. 302/16647 useless extension candidates. Maximal degree in co-relation 53075. Up to 8362 conditions per place. [2023-01-28 06:51:46,643 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 55 selfloop transitions, 8 changer transitions 3/79 dead transitions. [2023-01-28 06:51:46,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 612 flow [2023-01-28 06:51:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:51:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:51:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-01-28 06:51:46,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255878284923928 [2023-01-28 06:51:46,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-01-28 06:51:46,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-01-28 06:51:46,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:46,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-01-28 06:51:46,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 06:51:46,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:46,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states 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 06:51:46,646 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 385 flow. Second operand 3 states and 380 transitions. [2023-01-28 06:51:46,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 612 flow [2023-01-28 06:51:46,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 598 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 06:51:46,684 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 384 flow [2023-01-28 06:51:46,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-01-28 06:51:46,685 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2023-01-28 06:51:46,685 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 384 flow [2023-01-28 06:51:46,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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 06:51:46,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:46,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:46,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:51:46,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:46,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 441616047, now seen corresponding path program 1 times [2023-01-28 06:51:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597699622] [2023-01-28 06:51:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:46,892 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 06:51:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597699622] [2023-01-28 06:51:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597699622] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:51:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655173232] [2023-01-28 06:51:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:46,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:46,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 06:51:46,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:46,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:46,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 06:51:46,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:47,761 INFO L130 PetriNetUnfolder]: 6715/10629 cut-off events. [2023-01-28 06:51:47,761 INFO L131 PetriNetUnfolder]: For 12249/13192 co-relation queries the response was YES. [2023-01-28 06:51:47,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31995 conditions, 10629 events. 6715/10629 cut-off events. For 12249/13192 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 71123 event pairs, 775 based on Foata normal form. 1256/11702 useless extension candidates. Maximal degree in co-relation 31971. Up to 3882 conditions per place. [2023-01-28 06:51:47,810 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 90 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2023-01-28 06:51:47,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 922 flow [2023-01-28 06:51:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:51:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:51:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-01-28 06:51:47,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112033195020746 [2023-01-28 06:51:47,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-01-28 06:51:47,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-01-28 06:51:47,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:47,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-01-28 06:51:47,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 06:51:47,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 06:51:47,815 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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 06:51:47,815 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 384 flow. Second operand 5 states and 616 transitions. [2023-01-28 06:51:47,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 922 flow [2023-01-28 06:51:47,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 118 transitions, 882 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-01-28 06:51:47,824 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 431 flow [2023-01-28 06:51:47,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-01-28 06:51:47,825 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-01-28 06:51:47,825 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 431 flow [2023-01-28 06:51:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:47,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:47,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:47,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:51:47,825 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:47,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1290047879, now seen corresponding path program 1 times [2023-01-28 06:51:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070116368] [2023-01-28 06:51:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:48,067 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 06:51:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:48,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070116368] [2023-01-28 06:51:48,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070116368] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:48,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:51:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903221360] [2023-01-28 06:51:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:51:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:51:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:51:48,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 06:51:48,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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 06:51:48,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:48,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 06:51:48,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:49,030 INFO L130 PetriNetUnfolder]: 5971/9488 cut-off events. [2023-01-28 06:51:49,031 INFO L131 PetriNetUnfolder]: For 16463/17267 co-relation queries the response was YES. [2023-01-28 06:51:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33321 conditions, 9488 events. 5971/9488 cut-off events. For 16463/17267 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 62900 event pairs, 753 based on Foata normal form. 603/9913 useless extension candidates. Maximal degree in co-relation 33295. Up to 3882 conditions per place. [2023-01-28 06:51:49,071 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 100 selfloop transitions, 14 changer transitions 2/134 dead transitions. [2023-01-28 06:51:49,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 134 transitions, 1043 flow [2023-01-28 06:51:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:51:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:51:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-01-28 06:51:49,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117565698478561 [2023-01-28 06:51:49,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-01-28 06:51:49,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-01-28 06:51:49,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:49,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-01-28 06:51:49,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states 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 06:51:49,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 06:51:49,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 06:51:49,080 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 431 flow. Second operand 6 states and 740 transitions. [2023-01-28 06:51:49,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 134 transitions, 1043 flow [2023-01-28 06:51:49,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 1016 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 06:51:49,091 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 491 flow [2023-01-28 06:51:49,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-01-28 06:51:49,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-01-28 06:51:49,091 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 491 flow [2023-01-28 06:51:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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 06:51:49,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:49,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:51:49,092 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:49,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1350606384, now seen corresponding path program 1 times [2023-01-28 06:51:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27370668] [2023-01-28 06:51:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:49,842 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 06:51:49,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:49,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27370668] [2023-01-28 06:51:49,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27370668] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:49,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:51:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349499549] [2023-01-28 06:51:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:49,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:51:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:51:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:51:49,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-01-28 06:51:49,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 06:51:49,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:49,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-01-28 06:51:49,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:51,414 INFO L130 PetriNetUnfolder]: 10581/16866 cut-off events. [2023-01-28 06:51:51,414 INFO L131 PetriNetUnfolder]: For 50929/52698 co-relation queries the response was YES. [2023-01-28 06:51:51,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65799 conditions, 16866 events. 10581/16866 cut-off events. For 50929/52698 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 125668 event pairs, 734 based on Foata normal form. 372/17025 useless extension candidates. Maximal degree in co-relation 65772. Up to 4944 conditions per place. [2023-01-28 06:51:51,480 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 142 selfloop transitions, 7 changer transitions 56/223 dead transitions. [2023-01-28 06:51:51,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 223 transitions, 2050 flow [2023-01-28 06:51:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2023-01-28 06:51:51,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973325429756965 [2023-01-28 06:51:51,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2023-01-28 06:51:51,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2023-01-28 06:51:51,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:51,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2023-01-28 06:51:51,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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 06:51:51,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:51,486 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:51,486 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 491 flow. Second operand 7 states and 839 transitions. [2023-01-28 06:51:51,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 223 transitions, 2050 flow [2023-01-28 06:51:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 223 transitions, 1888 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-01-28 06:51:51,750 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 533 flow [2023-01-28 06:51:51,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=533, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-01-28 06:51:51,751 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-01-28 06:51:51,751 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 533 flow [2023-01-28 06:51:51,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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 06:51:51,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:51,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:51:51,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:51,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 397964994, now seen corresponding path program 2 times [2023-01-28 06:51:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994180926] [2023-01-28 06:51:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:52,015 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 06:51:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994180926] [2023-01-28 06:51:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994180926] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:52,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:51:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563932472] [2023-01-28 06:51:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:51:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:51:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:51:52,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-01-28 06:51:52,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 06:51:52,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:52,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-01-28 06:51:52,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:53,086 INFO L130 PetriNetUnfolder]: 7584/12343 cut-off events. [2023-01-28 06:51:53,087 INFO L131 PetriNetUnfolder]: For 30363/31222 co-relation queries the response was YES. [2023-01-28 06:51:53,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47948 conditions, 12343 events. 7584/12343 cut-off events. For 30363/31222 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 89587 event pairs, 756 based on Foata normal form. 368/12493 useless extension candidates. Maximal degree in co-relation 47921. Up to 4904 conditions per place. [2023-01-28 06:51:53,165 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 83 selfloop transitions, 18 changer transitions 14/130 dead transitions. [2023-01-28 06:51:53,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 130 transitions, 1098 flow [2023-01-28 06:51:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-01-28 06:51:53,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955542382928275 [2023-01-28 06:51:53,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-01-28 06:51:53,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-01-28 06:51:53,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:53,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-01-28 06:51:53,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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 06:51:53,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:53,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:53,172 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 533 flow. Second operand 7 states and 836 transitions. [2023-01-28 06:51:53,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 130 transitions, 1098 flow [2023-01-28 06:51:53,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 130 transitions, 1067 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-01-28 06:51:53,578 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 510 flow [2023-01-28 06:51:53,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-01-28 06:51:53,578 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-01-28 06:51:53,578 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 510 flow [2023-01-28 06:51:53,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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 06:51:53,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:53,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:53,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:51:53,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:53,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash -724937577, now seen corresponding path program 1 times [2023-01-28 06:51:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111784537] [2023-01-28 06:51:53,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:54,225 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 06:51:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111784537] [2023-01-28 06:51:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111784537] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:51:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819166396] [2023-01-28 06:51:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:54,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:51:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:51:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:51:54,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-01-28 06:51:54,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 510 flow. Second operand has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 06:51:54,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:54,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-01-28 06:51:54,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:54,893 INFO L130 PetriNetUnfolder]: 4180/6767 cut-off events. [2023-01-28 06:51:54,894 INFO L131 PetriNetUnfolder]: For 22934/23415 co-relation queries the response was YES. [2023-01-28 06:51:54,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28738 conditions, 6767 events. 4180/6767 cut-off events. For 22934/23415 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 43367 event pairs, 710 based on Foata normal form. 121/6779 useless extension candidates. Maximal degree in co-relation 28708. Up to 3137 conditions per place. [2023-01-28 06:51:54,927 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 97 selfloop transitions, 6 changer transitions 27/145 dead transitions. [2023-01-28 06:51:54,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 145 transitions, 1391 flow [2023-01-28 06:51:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:51:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:51:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2023-01-28 06:51:54,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718435091879075 [2023-01-28 06:51:54,929 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 796 transitions. [2023-01-28 06:51:54,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 796 transitions. [2023-01-28 06:51:54,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:54,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 796 transitions. [2023-01-28 06:51:54,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:51:54,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:54,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states 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 06:51:54,933 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 510 flow. Second operand 7 states and 796 transitions. [2023-01-28 06:51:54,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 145 transitions, 1391 flow [2023-01-28 06:51:55,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 145 transitions, 1235 flow, removed 26 selfloop flow, removed 7 redundant places. [2023-01-28 06:51:55,058 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 466 flow [2023-01-28 06:51:55,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2023-01-28 06:51:55,060 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-01-28 06:51:55,060 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 466 flow [2023-01-28 06:51:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 06:51:55,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:55,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:55,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:51:55,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:55,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1169034971, now seen corresponding path program 2 times [2023-01-28 06:51:55,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:55,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867506057] [2023-01-28 06:51:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:51:55,273 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 06:51:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:51:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867506057] [2023-01-28 06:51:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867506057] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:51:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:51:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:51:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344586607] [2023-01-28 06:51:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:51:55,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:51:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:51:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:51:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:51:55,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-01-28 06:51:55,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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 06:51:55,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:51:55,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-01-28 06:51:55,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:51:56,210 INFO L130 PetriNetUnfolder]: 7007/10772 cut-off events. [2023-01-28 06:51:56,210 INFO L131 PetriNetUnfolder]: For 33940/33940 co-relation queries the response was YES. [2023-01-28 06:51:56,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43860 conditions, 10772 events. 7007/10772 cut-off events. For 33940/33940 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 64455 event pairs, 1967 based on Foata normal form. 1/10773 useless extension candidates. Maximal degree in co-relation 43837. Up to 5488 conditions per place. [2023-01-28 06:51:56,237 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 63 selfloop transitions, 10 changer transitions 88/161 dead transitions. [2023-01-28 06:51:56,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 161 transitions, 1423 flow [2023-01-28 06:51:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:51:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:51:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-01-28 06:51:56,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49100968188105115 [2023-01-28 06:51:56,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-01-28 06:51:56,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-01-28 06:51:56,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:51:56,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-01-28 06:51:56,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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 06:51:56,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 06:51:56,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states 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 06:51:56,243 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 466 flow. Second operand 6 states and 710 transitions. [2023-01-28 06:51:56,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 161 transitions, 1423 flow [2023-01-28 06:51:56,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 161 transitions, 1377 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-01-28 06:51:56,414 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 383 flow [2023-01-28 06:51:56,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-01-28 06:51:56,414 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2023-01-28 06:51:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 383 flow [2023-01-28 06:51:56,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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 06:51:56,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:51:56,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:51:56,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 06:51:56,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:51:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1650386525, now seen corresponding path program 3 times [2023-01-28 06:51:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:51:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322725128] [2023-01-28 06:51:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:51:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:51:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:51:56,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:51:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:51:56,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:51:56,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:51:56,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:51:56,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:51:56,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:51:56,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:51:56,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:51:56,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:51:56,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:51:56,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:51:56,515 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:51:56,520 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:51:56,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:51:56,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:51:56 BasicIcfg [2023-01-28 06:51:56,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:51:56,596 INFO L158 Benchmark]: Toolchain (without parser) took 25541.87ms. Allocated memory was 341.8MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 298.9MB in the beginning and 2.3GB in the end (delta: -2.0GB). Peak memory consumption was 300.9MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,596 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 341.8MB. Free memory is still 290.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:51:56,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.21ms. Allocated memory is still 341.8MB. Free memory was 298.9MB in the beginning and 274.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 341.8MB. Free memory was 274.8MB in the beginning and 272.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,596 INFO L158 Benchmark]: Boogie Preprocessor took 23.22ms. Allocated memory is still 341.8MB. Free memory was 272.7MB in the beginning and 270.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,597 INFO L158 Benchmark]: RCFGBuilder took 658.87ms. Allocated memory is still 341.8MB. Free memory was 270.6MB in the beginning and 229.7MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,597 INFO L158 Benchmark]: TraceAbstraction took 24351.41ms. Allocated memory was 341.8MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 229.7MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 231.7MB. Max. memory is 16.0GB. [2023-01-28 06:51:56,598 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.09ms. Allocated memory is still 341.8MB. Free memory is still 290.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 464.21ms. Allocated memory is still 341.8MB. Free memory was 298.9MB in the beginning and 274.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 341.8MB. Free memory was 274.8MB in the beginning and 272.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.22ms. Allocated memory is still 341.8MB. Free memory was 272.7MB in the beginning and 270.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 658.87ms. Allocated memory is still 341.8MB. Free memory was 270.6MB in the beginning and 229.7MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 24351.41ms. Allocated memory was 341.8MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 229.7MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 231.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3605, independent: 3360, independent conditional: 0, independent unconditional: 3360, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1694, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3605, independent: 1711, independent conditional: 0, independent unconditional: 1711, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 1694, unknown conditional: 0, unknown unconditional: 1694] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t521, ((void *)0), P0, ((void *)0))=-3, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=-2, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=-1, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t524, ((void *)0), P3, ((void *)0))=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, x=1, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=1, x=1, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice2=1, x=1, y=2, z=1] [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=1, x=1, y=2, 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: 867]: 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: 871]: 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: 873]: 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: 869]: 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 9 procedures, 168 locations, 7 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: 24.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 636 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 26 mSDtfsCounter, 1456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=10, InterpolantAutomatonStates: 63, 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.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 1838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:51:56,632 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...