/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/mix004.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:47:23,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:47:23,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:47:23,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:47:23,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:47:23,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:47:23,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:47:23,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:47:23,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:47:23,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:47:23,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:47:23,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:47:23,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:47:23,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:47:23,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:47:23,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:47:23,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:47:23,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:47:23,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:47:23,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:47:23,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:47:23,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:47:23,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:47:23,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:47:23,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:47:23,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:47:23,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:47:23,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:47:23,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:47:23,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:47:23,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:47:23,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:47:23,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:47:23,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:47:23,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:47:23,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:47:23,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:47:23,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:47:23,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:47:23,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:47:23,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:47:23,280 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:47:23,302 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:47:23,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:47:23,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:47:23,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:47:23,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:47:23,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:47:23,304 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:47:23,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:47:23,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:47:23,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:47:23,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:47:23,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:47:23,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:47:23,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:47:23,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:47:23,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:47:23,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:47:23,307 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:47:23,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:47:23,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:47:23,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:47:23,540 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:47:23,541 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:47:23,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-01-28 06:47:24,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:47:24,724 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:47:24,725 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-01-28 06:47:24,733 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534020e5a/a35e61801b424bc6a80cd0df343e85c5/FLAG8166f58ae [2023-01-28 06:47:24,747 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534020e5a/a35e61801b424bc6a80cd0df343e85c5 [2023-01-28 06:47:24,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:47:24,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:47:24,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:47:24,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:47:24,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:47:24,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:47:24" (1/1) ... [2023-01-28 06:47:24,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11eb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:24, skipping insertion in model container [2023-01-28 06:47:24,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:47:24" (1/1) ... [2023-01-28 06:47:24,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:47:24,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:47:24,891 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/mix004.oepc.i[945,958] [2023-01-28 06:47:25,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:47:25,070 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:47:25,079 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/mix004.oepc.i[945,958] [2023-01-28 06:47:25,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:47:25,173 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:47:25,173 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:47:25,178 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:47:25,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25 WrapperNode [2023-01-28 06:47:25,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:47:25,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:47:25,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:47:25,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:47:25,184 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:47:25" (1/1) ... [2023-01-28 06:47:25,214 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:47:25" (1/1) ... [2023-01-28 06:47:25,239 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-01-28 06:47:25,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:47:25,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:47:25,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:47:25,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:47:25,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,268 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:47:25,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:47:25,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:47:25,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:47:25,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (1/1) ... [2023-01-28 06:47:25,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:47:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:47:25,304 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:47:25,341 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:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:47:25,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:47:25,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:47:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:47:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:47:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:47:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:47:25,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:47:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:47:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:47:25,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:47:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:47:25,359 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:47:25,473 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:47:25,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:47:25,846 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:47:25,929 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:47:25,929 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:47:25,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:47:25 BoogieIcfgContainer [2023-01-28 06:47:25,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:47:25,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:47:25,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:47:25,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:47:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:47:24" (1/3) ... [2023-01-28 06:47:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3552d159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:47:25, skipping insertion in model container [2023-01-28 06:47:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:47:25" (2/3) ... [2023-01-28 06:47:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3552d159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:47:25, skipping insertion in model container [2023-01-28 06:47:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:47:25" (3/3) ... [2023-01-28 06:47:25,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2023-01-28 06:47:25,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:47:25,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:47:25,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:47:26,001 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:47:26,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2023-01-28 06:47:26,076 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-01-28 06:47:26,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:26,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:47:26,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2023-01-28 06:47:26,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-01-28 06:47:26,091 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:47:26,102 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-01-28 06:47:26,103 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-01-28 06:47:26,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-01-28 06:47:26,132 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2023-01-28 06:47:26,132 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:47:26,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-01-28 06:47:28,889 INFO L134 LiptonReduction]: Checked pairs total: 9400 [2023-01-28 06:47:28,889 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-01-28 06:47:28,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:47:28,904 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;@c34ce73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:47:28,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:47:28,908 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 06:47:28,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:47:28,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:28,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:47:28,909 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:47:28,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 559364, now seen corresponding path program 1 times [2023-01-28 06:47:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127619038] [2023-01-28 06:47:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:29,236 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:47:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127619038] [2023-01-28 06:47:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127619038] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:47:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721447502] [2023-01-28 06:47:29,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:29,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:47:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:47:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:47:29,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-01-28 06:47:29,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:29,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:29,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-01-28 06:47:29,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:30,051 INFO L130 PetriNetUnfolder]: 4903/6758 cut-off events. [2023-01-28 06:47:30,051 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-01-28 06:47:30,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 6758 events. 4903/6758 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33781 event pairs, 2535 based on Foata normal form. 0/6415 useless extension candidates. Maximal degree in co-relation 13594. Up to 5335 conditions per place. [2023-01-28 06:47:30,085 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-01-28 06:47:30,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-01-28 06:47:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:47:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:47:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-01-28 06:47:30,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2023-01-28 06:47:30,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-01-28 06:47:30,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-01-28 06:47:30,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:30,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-01-28 06:47:30,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:47:30,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:30,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:30,110 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 402 transitions. [2023-01-28 06:47:30,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-01-28 06:47:30,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:47:30,115 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-01-28 06:47:30,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-01-28 06:47:30,118 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-28 06:47:30,118 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-01-28 06:47:30,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:30,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:30,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:30,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:47:30,119 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:47:30,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1411045857, now seen corresponding path program 1 times [2023-01-28 06:47:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902911352] [2023-01-28 06:47:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:30,373 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:47:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:30,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902911352] [2023-01-28 06:47:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902911352] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:30,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:30,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:47:30,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795193572] [2023-01-28 06:47:30,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:47:30,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:30,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:47:30,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:47:30,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-01-28 06:47:30,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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:47:30,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:30,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-01-28 06:47:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:31,444 INFO L130 PetriNetUnfolder]: 11615/15560 cut-off events. [2023-01-28 06:47:31,445 INFO L131 PetriNetUnfolder]: For 783/783 co-relation queries the response was YES. [2023-01-28 06:47:31,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32270 conditions, 15560 events. 11615/15560 cut-off events. For 783/783 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 72409 event pairs, 5763 based on Foata normal form. 16/15576 useless extension candidates. Maximal degree in co-relation 32260. Up to 15369 conditions per place. [2023-01-28 06:47:31,536 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 40 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2023-01-28 06:47:31,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 200 flow [2023-01-28 06:47:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:47:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:47:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-01-28 06:47:31,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.497289972899729 [2023-01-28 06:47:31,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-01-28 06:47:31,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-01-28 06:47:31,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:31,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-01-28 06:47:31,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:31,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:31,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:31,542 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 367 transitions. [2023-01-28 06:47:31,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 200 flow [2023-01-28 06:47:31,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:47:31,544 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 99 flow [2023-01-28 06:47:31,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-01-28 06:47:31,544 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-28 06:47:31,545 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 99 flow [2023-01-28 06:47:31,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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:47:31,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:31,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:47:31,545 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:47:31,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -995658739, now seen corresponding path program 1 times [2023-01-28 06:47:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961884509] [2023-01-28 06:47:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:31,832 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:47:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961884509] [2023-01-28 06:47:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961884509] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:47:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038533478] [2023-01-28 06:47:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:47:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:47:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:47:31,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-01-28 06:47:31,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:47:31,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:31,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-01-28 06:47:31,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:32,735 INFO L130 PetriNetUnfolder]: 10649/14310 cut-off events. [2023-01-28 06:47:32,735 INFO L131 PetriNetUnfolder]: For 2280/2280 co-relation queries the response was YES. [2023-01-28 06:47:32,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32229 conditions, 14310 events. 10649/14310 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 67812 event pairs, 3075 based on Foata normal form. 284/14594 useless extension candidates. Maximal degree in co-relation 32218. Up to 10611 conditions per place. [2023-01-28 06:47:32,807 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 06:47:32,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 241 flow [2023-01-28 06:47:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:47:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:47:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-01-28 06:47:32,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986449864498645 [2023-01-28 06:47:32,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-01-28 06:47:32,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-01-28 06:47:32,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:32,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-01-28 06:47:32,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:47:32,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:32,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:32,811 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 99 flow. Second operand 3 states and 368 transitions. [2023-01-28 06:47:32,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 241 flow [2023-01-28 06:47:32,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:47:32,813 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 105 flow [2023-01-28 06:47:32,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-01-28 06:47:32,815 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-01-28 06:47:32,817 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 105 flow [2023-01-28 06:47:32,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:47:32,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:32,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:32,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:47:32,818 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:47:32,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 674594654, now seen corresponding path program 1 times [2023-01-28 06:47:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974510266] [2023-01-28 06:47:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:32,982 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:47:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974510266] [2023-01-28 06:47:32,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974510266] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:32,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:32,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:47:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662307981] [2023-01-28 06:47:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:32,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:47:32,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:47:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:47:32,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-01-28 06:47:32,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:47:32,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:32,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-01-28 06:47:32,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:33,978 INFO L130 PetriNetUnfolder]: 9979/13440 cut-off events. [2023-01-28 06:47:33,978 INFO L131 PetriNetUnfolder]: For 3892/3892 co-relation queries the response was YES. [2023-01-28 06:47:34,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31381 conditions, 13440 events. 9979/13440 cut-off events. For 3892/3892 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 60850 event pairs, 3181 based on Foata normal form. 200/13640 useless extension candidates. Maximal degree in co-relation 31368. Up to 9021 conditions per place. [2023-01-28 06:47:34,061 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-01-28 06:47:34,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 240 flow [2023-01-28 06:47:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:47:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:47:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-01-28 06:47:34,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2023-01-28 06:47:34,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-01-28 06:47:34,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-01-28 06:47:34,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:34,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-01-28 06:47:34,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:34,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:34,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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:47:34,065 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 105 flow. Second operand 3 states and 366 transitions. [2023-01-28 06:47:34,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 240 flow [2023-01-28 06:47:34,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:47:34,069 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 110 flow [2023-01-28 06:47:34,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-01-28 06:47:34,070 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-01-28 06:47:34,070 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 110 flow [2023-01-28 06:47:34,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:47:34,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:34,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:34,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:47:34,071 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:47:34,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:34,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2022540379, now seen corresponding path program 1 times [2023-01-28 06:47:34,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:34,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120553642] [2023-01-28 06:47:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:34,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:34,180 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:47:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120553642] [2023-01-28 06:47:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120553642] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:34,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:47:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468613687] [2023-01-28 06:47:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:34,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:47:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:47:34,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:47:34,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 06:47:34,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:47:34,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:34,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 06:47:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:34,695 INFO L130 PetriNetUnfolder]: 4742/7032 cut-off events. [2023-01-28 06:47:34,696 INFO L131 PetriNetUnfolder]: For 1066/1179 co-relation queries the response was YES. [2023-01-28 06:47:34,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15118 conditions, 7032 events. 4742/7032 cut-off events. For 1066/1179 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 40926 event pairs, 982 based on Foata normal form. 541/7404 useless extension candidates. Maximal degree in co-relation 15104. Up to 4383 conditions per place. [2023-01-28 06:47:34,730 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 60 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2023-01-28 06:47:34,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 348 flow [2023-01-28 06:47:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:47:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:47:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-01-28 06:47:34,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097560975609756 [2023-01-28 06:47:34,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-01-28 06:47:34,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-01-28 06:47:34,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:34,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-01-28 06:47:34,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:34,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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:47:34,735 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states 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:47:34,735 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 110 flow. Second operand 5 states and 627 transitions. [2023-01-28 06:47:34,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 348 flow [2023-01-28 06:47:34,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:47:34,738 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 179 flow [2023-01-28 06:47:34,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-01-28 06:47:34,738 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-01-28 06:47:34,738 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 179 flow [2023-01-28 06:47:34,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:47:34,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:34,739 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:47:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:47:34,739 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:47:34,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1997418321, now seen corresponding path program 1 times [2023-01-28 06:47:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108679110] [2023-01-28 06:47:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:34,945 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:47:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108679110] [2023-01-28 06:47:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108679110] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:34,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:47:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460591079] [2023-01-28 06:47:34,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:34,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:47:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:47:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:47:34,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 06:47:34,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:34,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:34,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 06:47:34,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:35,436 INFO L130 PetriNetUnfolder]: 3809/5853 cut-off events. [2023-01-28 06:47:35,437 INFO L131 PetriNetUnfolder]: For 2782/2804 co-relation queries the response was YES. [2023-01-28 06:47:35,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16267 conditions, 5853 events. 3809/5853 cut-off events. For 2782/2804 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 34826 event pairs, 610 based on Foata normal form. 350/6052 useless extension candidates. Maximal degree in co-relation 16250. Up to 1825 conditions per place. [2023-01-28 06:47:35,464 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 82 selfloop transitions, 19 changer transitions 0/110 dead transitions. [2023-01-28 06:47:35,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 110 transitions, 577 flow [2023-01-28 06:47:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:47:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:47:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-01-28 06:47:35,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110336817653891 [2023-01-28 06:47:35,467 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-01-28 06:47:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-01-28 06:47:35,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:35,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-01-28 06:47:35,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states 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:47:35,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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:47:35,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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:47:35,470 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 179 flow. Second operand 7 states and 880 transitions. [2023-01-28 06:47:35,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 110 transitions, 577 flow [2023-01-28 06:47:35,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:47:35,479 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 308 flow [2023-01-28 06:47:35,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2023-01-28 06:47:35,480 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2023-01-28 06:47:35,480 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 308 flow [2023-01-28 06:47:35,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:35,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:35,481 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] [2023-01-28 06:47:35,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:47:35,481 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:47:35,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash -329263794, now seen corresponding path program 1 times [2023-01-28 06:47:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:35,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733442526] [2023-01-28 06:47:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:35,635 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:47:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733442526] [2023-01-28 06:47:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733442526] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:47:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882881225] [2023-01-28 06:47:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:35,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:47:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:35,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:47:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:47:35,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2023-01-28 06:47:35,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:47:35,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:35,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2023-01-28 06:47:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:36,729 INFO L130 PetriNetUnfolder]: 10603/15201 cut-off events. [2023-01-28 06:47:36,729 INFO L131 PetriNetUnfolder]: For 28311/28311 co-relation queries the response was YES. [2023-01-28 06:47:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50894 conditions, 15201 events. 10603/15201 cut-off events. For 28311/28311 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 85989 event pairs, 531 based on Foata normal form. 66/15267 useless extension candidates. Maximal degree in co-relation 50873. Up to 8352 conditions per place. [2023-01-28 06:47:36,827 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 83 selfloop transitions, 10 changer transitions 46/139 dead transitions. [2023-01-28 06:47:36,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 1101 flow [2023-01-28 06:47:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:47:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:47:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2023-01-28 06:47:36,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2023-01-28 06:47:36,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2023-01-28 06:47:36,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2023-01-28 06:47:36,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:36,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2023-01-28 06:47:36,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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:47:36,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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:47:36,833 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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:47:36,833 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 308 flow. Second operand 6 states and 720 transitions. [2023-01-28 06:47:36,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 1101 flow [2023-01-28 06:47:37,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 139 transitions, 962 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-01-28 06:47:37,156 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 235 flow [2023-01-28 06:47:37,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-01-28 06:47:37,156 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-01-28 06:47:37,156 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 235 flow [2023-01-28 06:47:37,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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:47:37,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:37,157 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] [2023-01-28 06:47:37,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:47:37,157 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:47:37,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1350120414, now seen corresponding path program 1 times [2023-01-28 06:47:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928376107] [2023-01-28 06:47:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:37,336 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:47:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928376107] [2023-01-28 06:47:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928376107] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:47:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632350142] [2023-01-28 06:47:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:37,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:47:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:47:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:47:37,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2023-01-28 06:47:37,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:47:37,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:37,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2023-01-28 06:47:37,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:38,047 INFO L130 PetriNetUnfolder]: 6911/10294 cut-off events. [2023-01-28 06:47:38,047 INFO L131 PetriNetUnfolder]: For 14685/14685 co-relation queries the response was YES. [2023-01-28 06:47:38,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 10294 events. 6911/10294 cut-off events. For 14685/14685 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 56245 event pairs, 627 based on Foata normal form. 76/10370 useless extension candidates. Maximal degree in co-relation 32764. Up to 5045 conditions per place. [2023-01-28 06:47:38,086 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 81 selfloop transitions, 14 changer transitions 12/107 dead transitions. [2023-01-28 06:47:38,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 751 flow [2023-01-28 06:47:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:47:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:47:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2023-01-28 06:47:38,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2023-01-28 06:47:38,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2023-01-28 06:47:38,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2023-01-28 06:47:38,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:38,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2023-01-28 06:47:38,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:47:38,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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:47:38,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states 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:47:38,091 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 235 flow. Second operand 6 states and 711 transitions. [2023-01-28 06:47:38,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 751 flow [2023-01-28 06:47:38,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 700 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-01-28 06:47:38,125 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 282 flow [2023-01-28 06:47:38,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-01-28 06:47:38,126 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-01-28 06:47:38,126 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 282 flow [2023-01-28 06:47:38,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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:47:38,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:38,127 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] [2023-01-28 06:47:38,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:47:38,127 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:47:38,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1442626338, now seen corresponding path program 2 times [2023-01-28 06:47:38,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:38,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746575452] [2023-01-28 06:47:38,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:38,303 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:47:38,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746575452] [2023-01-28 06:47:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746575452] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:47:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631316449] [2023-01-28 06:47:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:38,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:47:38,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:38,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:47:38,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:47:38,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 06:47:38,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:47:38,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:38,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 06:47:38,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:38,833 INFO L130 PetriNetUnfolder]: 3439/5628 cut-off events. [2023-01-28 06:47:38,833 INFO L131 PetriNetUnfolder]: For 3934/3973 co-relation queries the response was YES. [2023-01-28 06:47:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16164 conditions, 5628 events. 3439/5628 cut-off events. For 3934/3973 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 35583 event pairs, 841 based on Foata normal form. 316/5785 useless extension candidates. Maximal degree in co-relation 16141. Up to 1832 conditions per place. [2023-01-28 06:47:38,854 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 74 selfloop transitions, 18 changer transitions 12/121 dead transitions. [2023-01-28 06:47:38,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 748 flow [2023-01-28 06:47:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:47:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:47:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-01-28 06:47:38,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116144018583043 [2023-01-28 06:47:38,856 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-01-28 06:47:38,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-01-28 06:47:38,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:38,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-01-28 06:47:38,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states 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:47:38,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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:47:38,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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:47:38,861 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 282 flow. Second operand 7 states and 881 transitions. [2023-01-28 06:47:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 748 flow [2023-01-28 06:47:38,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 121 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:47:38,870 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 420 flow [2023-01-28 06:47:38,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-01-28 06:47:38,870 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2023-01-28 06:47:38,870 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 420 flow [2023-01-28 06:47:38,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states 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:47:38,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:38,871 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] [2023-01-28 06:47:38,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:47:38,871 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:47:38,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1192700061, now seen corresponding path program 1 times [2023-01-28 06:47:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742415775] [2023-01-28 06:47:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:39,514 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:47:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742415775] [2023-01-28 06:47:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742415775] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:47:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34652903] [2023-01-28 06:47:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:39,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:47:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:47:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:47:39,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 246 [2023-01-28 06:47:39,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:47:39,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:39,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 246 [2023-01-28 06:47:39,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:40,683 INFO L130 PetriNetUnfolder]: 8666/13039 cut-off events. [2023-01-28 06:47:40,683 INFO L131 PetriNetUnfolder]: For 22669/22669 co-relation queries the response was YES. [2023-01-28 06:47:40,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45678 conditions, 13039 events. 8666/13039 cut-off events. For 22669/22669 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 77812 event pairs, 1073 based on Foata normal form. 11/13050 useless extension candidates. Maximal degree in co-relation 45650. Up to 8077 conditions per place. [2023-01-28 06:47:40,746 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 135 selfloop transitions, 26 changer transitions 52/213 dead transitions. [2023-01-28 06:47:40,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 213 transitions, 1767 flow [2023-01-28 06:47:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:47:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:47:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1031 transitions. [2023-01-28 06:47:40,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465672990063234 [2023-01-28 06:47:40,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1031 transitions. [2023-01-28 06:47:40,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1031 transitions. [2023-01-28 06:47:40,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:40,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1031 transitions. [2023-01-28 06:47:40,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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:47:40,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:47:40,770 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:47:40,770 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 420 flow. Second operand 9 states and 1031 transitions. [2023-01-28 06:47:40,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 213 transitions, 1767 flow [2023-01-28 06:47:41,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 213 transitions, 1530 flow, removed 94 selfloop flow, removed 2 redundant places. [2023-01-28 06:47:41,168 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 487 flow [2023-01-28 06:47:41,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2023-01-28 06:47:41,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-01-28 06:47:41,169 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 487 flow [2023-01-28 06:47:41,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:47:41,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:41,170 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] [2023-01-28 06:47:41,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:47:41,170 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:47:41,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1031860381, now seen corresponding path program 2 times [2023-01-28 06:47:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013853124] [2023-01-28 06:47:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:41,357 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:47:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013853124] [2023-01-28 06:47:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013853124] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:47:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707477263] [2023-01-28 06:47:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:41,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:47:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:47:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:47:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 06:47:41,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:47:41,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:41,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 06:47:41,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:42,136 INFO L130 PetriNetUnfolder]: 4561/7355 cut-off events. [2023-01-28 06:47:42,136 INFO L131 PetriNetUnfolder]: For 11009/11204 co-relation queries the response was YES. [2023-01-28 06:47:42,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25427 conditions, 7355 events. 4561/7355 cut-off events. For 11009/11204 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 48657 event pairs, 874 based on Foata normal form. 122/7224 useless extension candidates. Maximal degree in co-relation 25393. Up to 2870 conditions per place. [2023-01-28 06:47:42,162 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 72 selfloop transitions, 18 changer transitions 32/136 dead transitions. [2023-01-28 06:47:42,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 136 transitions, 1012 flow [2023-01-28 06:47:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:47:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:47:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 979 transitions. [2023-01-28 06:47:42,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974593495934959 [2023-01-28 06:47:42,165 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 979 transitions. [2023-01-28 06:47:42,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 979 transitions. [2023-01-28 06:47:42,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:42,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 979 transitions. [2023-01-28 06:47:42,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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:47:42,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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:47:42,169 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states 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:47:42,169 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 487 flow. Second operand 8 states and 979 transitions. [2023-01-28 06:47:42,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 136 transitions, 1012 flow [2023-01-28 06:47:42,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 136 transitions, 970 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-01-28 06:47:42,336 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 422 flow [2023-01-28 06:47:42,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=422, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-01-28 06:47:42,337 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-01-28 06:47:42,337 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 422 flow [2023-01-28 06:47:42,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:47:42,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:42,337 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, 1] [2023-01-28 06:47:42,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:47:42,337 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:47:42,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1346990293, now seen corresponding path program 1 times [2023-01-28 06:47:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804114955] [2023-01-28 06:47:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:43,127 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:47:43,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:43,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804114955] [2023-01-28 06:47:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804114955] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:43,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:43,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:47:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254486785] [2023-01-28 06:47:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:43,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:47:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:47:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:47:43,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 246 [2023-01-28 06:47:43,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 422 flow. Second operand has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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:47:43,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:43,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 246 [2023-01-28 06:47:43,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:43,999 INFO L130 PetriNetUnfolder]: 4826/7360 cut-off events. [2023-01-28 06:47:43,999 INFO L131 PetriNetUnfolder]: For 16579/16579 co-relation queries the response was YES. [2023-01-28 06:47:44,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28241 conditions, 7360 events. 4826/7360 cut-off events. For 16579/16579 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 41084 event pairs, 1366 based on Foata normal form. 1/7361 useless extension candidates. Maximal degree in co-relation 28212. Up to 3254 conditions per place. [2023-01-28 06:47:44,022 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 106 selfloop transitions, 12 changer transitions 56/174 dead transitions. [2023-01-28 06:47:44,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 174 transitions, 1487 flow [2023-01-28 06:47:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:47:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:47:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 995 transitions. [2023-01-28 06:47:44,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44941282746160793 [2023-01-28 06:47:44,024 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 995 transitions. [2023-01-28 06:47:44,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 995 transitions. [2023-01-28 06:47:44,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:44,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 995 transitions. [2023-01-28 06:47:44,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:44,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:47:44,029 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states 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:47:44,029 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 422 flow. Second operand 9 states and 995 transitions. [2023-01-28 06:47:44,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 174 transitions, 1487 flow [2023-01-28 06:47:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 174 transitions, 1213 flow, removed 80 selfloop flow, removed 10 redundant places. [2023-01-28 06:47:44,132 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 324 flow [2023-01-28 06:47:44,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2023-01-28 06:47:44,132 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-01-28 06:47:44,132 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 54 transitions, 324 flow [2023-01-28 06:47:44,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states 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:47:44,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:44,133 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, 1] [2023-01-28 06:47:44,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:47:44,133 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:47:44,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1608744771, now seen corresponding path program 2 times [2023-01-28 06:47:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114170442] [2023-01-28 06:47:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:47:44,302 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:47:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:47:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114170442] [2023-01-28 06:47:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114170442] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:47:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:47:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:47:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253377121] [2023-01-28 06:47:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:47:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:47:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:47:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:47:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:47:44,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-01-28 06:47:44,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 54 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:44,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:47:44,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-01-28 06:47:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:47:44,678 INFO L130 PetriNetUnfolder]: 2760/4596 cut-off events. [2023-01-28 06:47:44,678 INFO L131 PetriNetUnfolder]: For 8343/8363 co-relation queries the response was YES. [2023-01-28 06:47:44,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16180 conditions, 4596 events. 2760/4596 cut-off events. For 8343/8363 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 28162 event pairs, 737 based on Foata normal form. 1/4481 useless extension candidates. Maximal degree in co-relation 16153. Up to 2120 conditions per place. [2023-01-28 06:47:44,696 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 42 selfloop transitions, 1 changer transitions 60/107 dead transitions. [2023-01-28 06:47:44,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 821 flow [2023-01-28 06:47:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:47:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:47:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-01-28 06:47:44,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223577235772358 [2023-01-28 06:47:44,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-01-28 06:47:44,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-01-28 06:47:44,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:47:44,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-01-28 06:47:44,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:47:44,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:47:44,700 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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:47:44,700 INFO L175 Difference]: Start difference. First operand has 81 places, 54 transitions, 324 flow. Second operand 4 states and 514 transitions. [2023-01-28 06:47:44,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 821 flow [2023-01-28 06:47:44,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 757 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-01-28 06:47:44,741 INFO L231 Difference]: Finished difference. Result has 70 places, 43 transitions, 224 flow [2023-01-28 06:47:44,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2023-01-28 06:47:44,742 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2023-01-28 06:47:44,742 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 224 flow [2023-01-28 06:47:44,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:47:44,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:47:44,743 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, 1] [2023-01-28 06:47:44,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:47:44,743 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:47:44,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:47:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1863164995, now seen corresponding path program 3 times [2023-01-28 06:47:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:47:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537225152] [2023-01-28 06:47:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:47:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:47:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:47:44,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:47:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:47:44,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:47:44,890 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:47:44,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:47:44,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:47:44,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:47:44,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:47:44,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:47:44,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:47:44,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:47:44,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:47:44,892 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:47:44,897 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:47:44,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:47:44,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:47:44 BasicIcfg [2023-01-28 06:47:44,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:47:44,980 INFO L158 Benchmark]: Toolchain (without parser) took 20229.43ms. Allocated memory was 736.1MB in the beginning and 1.7GB in the end (delta: 1.0GB). Free memory was 684.4MB in the beginning and 974.4MB in the end (delta: -290.0MB). Peak memory consumption was 721.2MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,980 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 394.3MB. Free memory is still 342.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:47:44,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.95ms. Allocated memory is still 736.1MB. Free memory was 684.4MB in the beginning and 660.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 736.1MB. Free memory was 660.3MB in the beginning and 657.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,981 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 736.1MB. Free memory was 657.9MB in the beginning and 655.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,981 INFO L158 Benchmark]: RCFGBuilder took 659.41ms. Allocated memory is still 736.1MB. Free memory was 655.8MB in the beginning and 677.4MB in the end (delta: -21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,981 INFO L158 Benchmark]: TraceAbstraction took 19047.37ms. Allocated memory was 736.1MB in the beginning and 1.7GB in the end (delta: 1.0GB). Free memory was 676.3MB in the beginning and 974.4MB in the end (delta: -298.1MB). Peak memory consumption was 710.6MB. Max. memory is 16.0GB. [2023-01-28 06:47:44,982 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 394.3MB. Free memory is still 342.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 425.95ms. Allocated memory is still 736.1MB. Free memory was 684.4MB in the beginning and 660.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 736.1MB. Free memory was 660.3MB in the beginning and 657.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 736.1MB. Free memory was 657.9MB in the beginning and 655.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 659.41ms. Allocated memory is still 736.1MB. Free memory was 655.8MB in the beginning and 677.4MB in the end (delta: -21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 19047.37ms. Allocated memory was 736.1MB in the beginning and 1.7GB in the end (delta: 1.0GB). Free memory was 676.3MB in the beginning and 974.4MB in the end (delta: -298.1MB). Peak memory consumption was 710.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 141 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 32 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 9400 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4118, independent: 3885, independent conditional: 0, independent unconditional: 3885, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1786, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4118, independent: 2151, independent conditional: 0, independent unconditional: 2151, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1786, unknown conditional: 0, unknown unconditional: 1786] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t89, ((void *)0), P0, ((void *)0))=-3, t89={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t90, ((void *)0), P1, ((void *)0))=-2, t89={5:0}, t90={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t91, ((void *)0), P2, ((void *)0))=-1, t89={5:0}, t90={6:0}, t91={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t92, ((void *)0), P3, ((void *)0))=0, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 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) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] [L772] 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) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 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 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] [L792] 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) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 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 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L815] 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) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 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 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L851] 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) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 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 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 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) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 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 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 880]: 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: 874]: 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: 876]: 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, 172 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: 18.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 615 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1748 IncrementalHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 63 mSDtfsCounter, 1748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=10, InterpolantAutomatonStates: 73, 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.1s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2030 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:47:44,995 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...