/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:20:46,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:20:46,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:20:46,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:20:46,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:20:46,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:20:46,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:20:46,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:20:46,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:20:46,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:20:46,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:20:46,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:20:46,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:20:46,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:20:46,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:20:46,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:20:46,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:20:46,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:20:46,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:20:46,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:20:46,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:20:46,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:20:46,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:20:46,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:20:46,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:20:46,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:20:46,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:20:46,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:20:46,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:20:46,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:20:46,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:20:46,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:20:46,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:20:46,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:20:46,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:20:46,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:20:46,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:20:46,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:20:46,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:20:46,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:20:46,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:20:46,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:20:46,556 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:20:46,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:20:46,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:20:46,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:20:46,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:20:46,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:20:46,558 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:20:46,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:20:46,559 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:20:46,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:20:46,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:20:46,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:20:46,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:20:46,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:20:46,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:20:46,561 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:20:46,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:20:46,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:20:46,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:20:46,777 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:20:46,778 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:20:46,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-01-27 18:20:47,774 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:20:48,050 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:20:48,051 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-01-27 18:20:48,074 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e57a02d/7abcae8c8e3444a9aa87ba3a157e0317/FLAG4dffd36ed [2023-01-27 18:20:48,083 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e57a02d/7abcae8c8e3444a9aa87ba3a157e0317 [2023-01-27 18:20:48,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:20:48,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:20:48,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:20:48,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:20:48,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:20:48,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692b58b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48, skipping insertion in model container [2023-01-27 18:20:48,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:20:48,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:20:48,233 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/safe027_rmo.i[988,1001] [2023-01-27 18:20:48,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:20:48,414 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:20:48,423 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_rmo.i[988,1001] [2023-01-27 18:20:48,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:20:48,504 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:20:48,505 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:20:48,509 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:20:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48 WrapperNode [2023-01-27 18:20:48,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:20:48,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:20:48,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:20:48,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:20:48,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,566 INFO L138 Inliner]: procedures = 177, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2023-01-27 18:20:48,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:20:48,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:20:48,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:20:48,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:20:48,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:20:48,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:20:48,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:20:48,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:20:48,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (1/1) ... [2023-01-27 18:20:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:20:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:20:48,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:20:48,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:20:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:20:48,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:20:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:20:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:20:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:20:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:20:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:20:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:20:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:20:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:20:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:20:48,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:20:48,685 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:20:48,856 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:20:48,858 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:20:49,149 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:20:49,324 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:20:49,324 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:20:49,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:20:49 BoogieIcfgContainer [2023-01-27 18:20:49,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:20:49,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:20:49,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:20:49,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:20:49,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:20:48" (1/3) ... [2023-01-27 18:20:49,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@838e6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:20:49, skipping insertion in model container [2023-01-27 18:20:49,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:20:48" (2/3) ... [2023-01-27 18:20:49,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@838e6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:20:49, skipping insertion in model container [2023-01-27 18:20:49,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:20:49" (3/3) ... [2023-01-27 18:20:49,332 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_rmo.i [2023-01-27 18:20:49,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:20:49,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 18:20:49,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:20:49,402 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:20:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-01-27 18:20:49,495 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-01-27 18:20:49,495 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:20:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-01-27 18:20:49,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-01-27 18:20:49,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2023-01-27 18:20:49,511 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:20:49,527 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2023-01-27 18:20:49,528 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2023-01-27 18:20:49,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2023-01-27 18:20:49,556 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2023-01-27 18:20:49,557 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:20:49,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-01-27 18:20:49,560 INFO L119 LiptonReduction]: Number of co-enabled transitions 1654 [2023-01-27 18:20:54,025 INFO L134 LiptonReduction]: Checked pairs total: 3631 [2023-01-27 18:20:54,025 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:20:54,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:20:54,050 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;@457cbe13, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:20:54,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 18:20:54,060 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2023-01-27 18:20:54,060 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:20:54,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:54,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:54,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:54,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1001007376, now seen corresponding path program 1 times [2023-01-27 18:20:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043163436] [2023-01-27 18:20:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:54,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043163436] [2023-01-27 18:20:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043163436] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:54,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:20:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154555069] [2023-01-27 18:20:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:54,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:20:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:20:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:20:54,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 249 [2023-01-27 18:20:54,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:54,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:54,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 249 [2023-01-27 18:20:54,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:55,045 INFO L130 PetriNetUnfolder]: 1556/2195 cut-off events. [2023-01-27 18:20:55,045 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-01-27 18:20:55,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4492 conditions, 2195 events. 1556/2195 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9675 event pairs, 314 based on Foata normal form. 36/2230 useless extension candidates. Maximal degree in co-relation 4480. Up to 1801 conditions per place. [2023-01-27 18:20:55,055 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-01-27 18:20:55,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 145 flow [2023-01-27 18:20:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:20:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:20:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-01-27 18:20:55,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5622489959839357 [2023-01-27 18:20:55,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-01-27 18:20:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-01-27 18:20:55,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:55,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-01-27 18:20:55,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,075 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 56 flow. Second operand 3 states and 420 transitions. [2023-01-27 18:20:55,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 145 flow [2023-01-27 18:20:55,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:20:55,078 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 60 flow [2023-01-27 18:20:55,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-01-27 18:20:55,082 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-01-27 18:20:55,082 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 60 flow [2023-01-27 18:20:55,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:55,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:55,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:20:55,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:55,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 966456543, now seen corresponding path program 1 times [2023-01-27 18:20:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542190733] [2023-01-27 18:20:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542190733] [2023-01-27 18:20:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542190733] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:20:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390245332] [2023-01-27 18:20:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:20:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:20:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:20:55,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 249 [2023-01-27 18:20:55,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:55,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 249 [2023-01-27 18:20:55,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:55,647 INFO L130 PetriNetUnfolder]: 2757/3894 cut-off events. [2023-01-27 18:20:55,647 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2023-01-27 18:20:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8403 conditions, 3894 events. 2757/3894 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18211 event pairs, 493 based on Foata normal form. 144/4038 useless extension candidates. Maximal degree in co-relation 8392. Up to 1660 conditions per place. [2023-01-27 18:20:55,658 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 42 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2023-01-27 18:20:55,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 225 flow [2023-01-27 18:20:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:20:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:20:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-01-27 18:20:55,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582329317269076 [2023-01-27 18:20:55,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-01-27 18:20:55,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-01-27 18:20:55,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:55,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-01-27 18:20:55,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,665 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,665 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 60 flow. Second operand 4 states and 556 transitions. [2023-01-27 18:20:55,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 225 flow [2023-01-27 18:20:55,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:20:55,666 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 70 flow [2023-01-27 18:20:55,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-01-27 18:20:55,667 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-01-27 18:20:55,667 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 70 flow [2023-01-27 18:20:55,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:55,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:55,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:20:55,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:55,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -104644266, now seen corresponding path program 1 times [2023-01-27 18:20:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882813651] [2023-01-27 18:20:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882813651] [2023-01-27 18:20:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882813651] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:55,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:55,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:20:55,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567994422] [2023-01-27 18:20:55,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:20:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:20:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:20:55,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 249 [2023-01-27 18:20:55,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:55,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:55,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 249 [2023-01-27 18:20:55,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:56,062 INFO L130 PetriNetUnfolder]: 994/1579 cut-off events. [2023-01-27 18:20:56,062 INFO L131 PetriNetUnfolder]: For 602/602 co-relation queries the response was YES. [2023-01-27 18:20:56,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1579 events. 994/1579 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7444 event pairs, 228 based on Foata normal form. 24/1603 useless extension candidates. Maximal degree in co-relation 3590. Up to 1107 conditions per place. [2023-01-27 18:20:56,069 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 35 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-01-27 18:20:56,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 190 flow [2023-01-27 18:20:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:20:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:20:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-01-27 18:20:56,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5689424364123159 [2023-01-27 18:20:56,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-01-27 18:20:56,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-01-27 18:20:56,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:56,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-01-27 18:20:56,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:56,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:56,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:56,074 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 70 flow. Second operand 3 states and 425 transitions. [2023-01-27 18:20:56,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 190 flow [2023-01-27 18:20:56,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 173 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:20:56,077 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 66 flow [2023-01-27 18:20:56,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-01-27 18:20:56,078 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-01-27 18:20:56,080 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 66 flow [2023-01-27 18:20:56,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:56,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:56,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:56,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:20:56,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:56,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -12606257, now seen corresponding path program 1 times [2023-01-27 18:20:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182723921] [2023-01-27 18:20:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182723921] [2023-01-27 18:20:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182723921] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:56,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:20:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697117915] [2023-01-27 18:20:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:56,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:20:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:56,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:20:56,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:20:56,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 249 [2023-01-27 18:20:56,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:56,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:56,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 249 [2023-01-27 18:20:56,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:57,297 INFO L130 PetriNetUnfolder]: 1200/1808 cut-off events. [2023-01-27 18:20:57,297 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2023-01-27 18:20:57,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4231 conditions, 1808 events. 1200/1808 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8280 event pairs, 191 based on Foata normal form. 12/1820 useless extension candidates. Maximal degree in co-relation 4219. Up to 1051 conditions per place. [2023-01-27 18:20:57,305 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 39 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-01-27 18:20:57,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 227 flow [2023-01-27 18:20:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:20:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:20:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2023-01-27 18:20:57,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464859437751004 [2023-01-27 18:20:57,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 463 transitions. [2023-01-27 18:20:57,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 463 transitions. [2023-01-27 18:20:57,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:57,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 463 transitions. [2023-01-27 18:20:57,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:57,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:57,315 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:57,315 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 66 flow. Second operand 4 states and 463 transitions. [2023-01-27 18:20:57,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 227 flow [2023-01-27 18:20:57,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:20:57,317 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 108 flow [2023-01-27 18:20:57,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:20:57,318 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-01-27 18:20:57,318 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 108 flow [2023-01-27 18:20:57,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:57,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:57,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:57,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:20:57,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:57,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1610479219, now seen corresponding path program 2 times [2023-01-27 18:20:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635566600] [2023-01-27 18:20:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635566600] [2023-01-27 18:20:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635566600] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:58,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:20:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419269512] [2023-01-27 18:20:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:58,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:20:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:20:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:20:58,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 249 [2023-01-27 18:20:58,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:58,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 249 [2023-01-27 18:20:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:58,442 INFO L130 PetriNetUnfolder]: 1188/1772 cut-off events. [2023-01-27 18:20:58,442 INFO L131 PetriNetUnfolder]: For 725/725 co-relation queries the response was YES. [2023-01-27 18:20:58,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4645 conditions, 1772 events. 1188/1772 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7830 event pairs, 151 based on Foata normal form. 4/1776 useless extension candidates. Maximal degree in co-relation 4631. Up to 1357 conditions per place. [2023-01-27 18:20:58,449 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 44 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-01-27 18:20:58,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 298 flow [2023-01-27 18:20:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:20:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:20:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-01-27 18:20:58,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463855421686747 [2023-01-27 18:20:58,450 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-01-27 18:20:58,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-01-27 18:20:58,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:58,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-01-27 18:20:58,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,454 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,454 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 108 flow. Second operand 4 states and 462 transitions. [2023-01-27 18:20:58,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 298 flow [2023-01-27 18:20:58,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:20:58,456 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 160 flow [2023-01-27 18:20:58,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-01-27 18:20:58,458 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2023-01-27 18:20:58,458 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 160 flow [2023-01-27 18:20:58,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:58,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:20:58,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:58,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash -390795721, now seen corresponding path program 1 times [2023-01-27 18:20:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463574438] [2023-01-27 18:20:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:58,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463574438] [2023-01-27 18:20:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463574438] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:20:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102540570] [2023-01-27 18:20:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:20:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:20:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:20:58,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 249 [2023-01-27 18:20:58,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:58,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 249 [2023-01-27 18:20:58,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:58,893 INFO L130 PetriNetUnfolder]: 1194/1816 cut-off events. [2023-01-27 18:20:58,893 INFO L131 PetriNetUnfolder]: For 1580/1580 co-relation queries the response was YES. [2023-01-27 18:20:58,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 1816 events. 1194/1816 cut-off events. For 1580/1580 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8400 event pairs, 216 based on Foata normal form. 126/1942 useless extension candidates. Maximal degree in co-relation 5199. Up to 1315 conditions per place. [2023-01-27 18:20:58,900 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 53 selfloop transitions, 5 changer transitions 37/96 dead transitions. [2023-01-27 18:20:58,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 96 transitions, 657 flow [2023-01-27 18:20:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:20:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:20:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-01-27 18:20:58,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2023-01-27 18:20:58,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-01-27 18:20:58,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-01-27 18:20:58,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:58,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-01-27 18:20:58,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,906 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,906 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 160 flow. Second operand 5 states and 675 transitions. [2023-01-27 18:20:58,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 96 transitions, 657 flow [2023-01-27 18:20:58,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:20:58,909 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 205 flow [2023-01-27 18:20:58,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-01-27 18:20:58,910 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2023-01-27 18:20:58,910 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 205 flow [2023-01-27 18:20:58,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:58,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:58,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:58,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:20:58,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:58,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1274321881, now seen corresponding path program 1 times [2023-01-27 18:20:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038897153] [2023-01-27 18:20:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:20:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:20:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:20:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038897153] [2023-01-27 18:20:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038897153] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:20:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:20:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:20:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777337991] [2023-01-27 18:20:59,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:20:59,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:20:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:20:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:20:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:20:59,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 249 [2023-01-27 18:20:59,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:59,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:20:59,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 249 [2023-01-27 18:20:59,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:20:59,331 INFO L130 PetriNetUnfolder]: 796/1271 cut-off events. [2023-01-27 18:20:59,331 INFO L131 PetriNetUnfolder]: For 1663/1663 co-relation queries the response was YES. [2023-01-27 18:20:59,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 1271 events. 796/1271 cut-off events. For 1663/1663 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5733 event pairs, 74 based on Foata normal form. 98/1369 useless extension candidates. Maximal degree in co-relation 4822. Up to 573 conditions per place. [2023-01-27 18:20:59,374 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 70 selfloop transitions, 9 changer transitions 34/114 dead transitions. [2023-01-27 18:20:59,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 114 transitions, 851 flow [2023-01-27 18:20:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:20:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:20:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2023-01-27 18:20:59,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435073627844712 [2023-01-27 18:20:59,376 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2023-01-27 18:20:59,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2023-01-27 18:20:59,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:20:59,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2023-01-27 18:20:59,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:59,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:59,380 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:59,380 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 205 flow. Second operand 6 states and 812 transitions. [2023-01-27 18:20:59,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 114 transitions, 851 flow [2023-01-27 18:20:59,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 114 transitions, 844 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:20:59,385 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 270 flow [2023-01-27 18:20:59,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-01-27 18:20:59,386 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-01-27 18:20:59,386 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 270 flow [2023-01-27 18:20:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:20:59,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:20:59,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:20:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:20:59,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:20:59,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:20:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 862295983, now seen corresponding path program 1 times [2023-01-27 18:20:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:20:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680957236] [2023-01-27 18:20:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:20:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:20:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:21:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680957236] [2023-01-27 18:21:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680957236] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:00,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:00,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-27 18:21:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431244752] [2023-01-27 18:21:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 18:21:00,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 18:21:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-27 18:21:00,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 249 [2023-01-27 18:21:00,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 270 flow. Second operand has 9 states, 9 states have (on average 101.88888888888889) internal successors, (917), 9 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:00,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:00,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 249 [2023-01-27 18:21:00,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:00,862 INFO L130 PetriNetUnfolder]: 939/1613 cut-off events. [2023-01-27 18:21:00,862 INFO L131 PetriNetUnfolder]: For 4974/4974 co-relation queries the response was YES. [2023-01-27 18:21:00,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 1613 events. 939/1613 cut-off events. For 4974/4974 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8558 event pairs, 82 based on Foata normal form. 29/1642 useless extension candidates. Maximal degree in co-relation 7279. Up to 795 conditions per place. [2023-01-27 18:21:00,871 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 90 selfloop transitions, 17 changer transitions 25/133 dead transitions. [2023-01-27 18:21:00,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 133 transitions, 1211 flow [2023-01-27 18:21:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:21:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:21:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2023-01-27 18:21:00,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43775100401606426 [2023-01-27 18:21:00,873 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 981 transitions. [2023-01-27 18:21:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 981 transitions. [2023-01-27 18:21:00,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:00,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 981 transitions. [2023-01-27 18:21:00,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:00,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:00,878 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:00,878 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 270 flow. Second operand 9 states and 981 transitions. [2023-01-27 18:21:00,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 133 transitions, 1211 flow [2023-01-27 18:21:00,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 133 transitions, 993 flow, removed 84 selfloop flow, removed 4 redundant places. [2023-01-27 18:21:00,889 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 335 flow [2023-01-27 18:21:00,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=335, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-01-27 18:21:00,890 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2023-01-27 18:21:00,890 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 335 flow [2023-01-27 18:21:00,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.88888888888889) internal successors, (917), 9 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:00,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:00,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:00,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:21:00,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:00,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 604076369, now seen corresponding path program 1 times [2023-01-27 18:21:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035557269] [2023-01-27 18:21:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:21:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035557269] [2023-01-27 18:21:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035557269] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:01,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:21:01,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742297938] [2023-01-27 18:21:01,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:21:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:21:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:21:01,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 249 [2023-01-27 18:21:01,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:01,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 249 [2023-01-27 18:21:01,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:01,323 INFO L130 PetriNetUnfolder]: 1854/3034 cut-off events. [2023-01-27 18:21:01,323 INFO L131 PetriNetUnfolder]: For 8887/8887 co-relation queries the response was YES. [2023-01-27 18:21:01,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12769 conditions, 3034 events. 1854/3034 cut-off events. For 8887/8887 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16438 event pairs, 340 based on Foata normal form. 35/3069 useless extension candidates. Maximal degree in co-relation 12741. Up to 1583 conditions per place. [2023-01-27 18:21:01,336 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 75 selfloop transitions, 2 changer transitions 26/103 dead transitions. [2023-01-27 18:21:01,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 899 flow [2023-01-27 18:21:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:21:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:21:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-01-27 18:21:01,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5552208835341366 [2023-01-27 18:21:01,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-01-27 18:21:01,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-01-27 18:21:01,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:01,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-01-27 18:21:01,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,342 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,342 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 335 flow. Second operand 4 states and 553 transitions. [2023-01-27 18:21:01,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 899 flow [2023-01-27 18:21:01,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 861 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 18:21:01,357 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 328 flow [2023-01-27 18:21:01,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-01-27 18:21:01,357 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2023-01-27 18:21:01,357 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 328 flow [2023-01-27 18:21:01,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:01,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:01,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:21:01,358 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:01,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1505340667, now seen corresponding path program 2 times [2023-01-27 18:21:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103864867] [2023-01-27 18:21:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:21:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103864867] [2023-01-27 18:21:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103864867] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:21:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390149493] [2023-01-27 18:21:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:01,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:21:01,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:21:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:21:01,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 249 [2023-01-27 18:21:01,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:01,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 249 [2023-01-27 18:21:01,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:01,916 INFO L130 PetriNetUnfolder]: 1215/2094 cut-off events. [2023-01-27 18:21:01,917 INFO L131 PetriNetUnfolder]: For 5065/5109 co-relation queries the response was YES. [2023-01-27 18:21:01,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 2094 events. 1215/2094 cut-off events. For 5065/5109 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11920 event pairs, 70 based on Foata normal form. 181/2260 useless extension candidates. Maximal degree in co-relation 8712. Up to 946 conditions per place. [2023-01-27 18:21:01,928 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 93 selfloop transitions, 13 changer transitions 46/154 dead transitions. [2023-01-27 18:21:01,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 154 transitions, 1347 flow [2023-01-27 18:21:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:21:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:21:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-01-27 18:21:01,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2023-01-27 18:21:01,931 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-01-27 18:21:01,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-01-27 18:21:01,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:01,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-01-27 18:21:01,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,936 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,936 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 328 flow. Second operand 7 states and 945 transitions. [2023-01-27 18:21:01,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 154 transitions, 1347 flow [2023-01-27 18:21:01,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 154 transitions, 1339 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-27 18:21:01,948 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 403 flow [2023-01-27 18:21:01,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-01-27 18:21:01,949 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2023-01-27 18:21:01,949 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 403 flow [2023-01-27 18:21:01,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:01,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:01,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:01,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:21:01,950 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:01,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1064178829, now seen corresponding path program 1 times [2023-01-27 18:21:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:01,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929286739] [2023-01-27 18:21:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:01,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:21:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:21:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:21:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929286739] [2023-01-27 18:21:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929286739] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:21:02,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:21:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:21:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848826726] [2023-01-27 18:21:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:21:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:21:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:21:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:21:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:21:02,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 249 [2023-01-27 18:21:02,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 403 flow. Second operand has 7 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-27 18:21:02,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:21:02,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 249 [2023-01-27 18:21:02,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:21:02,357 INFO L130 PetriNetUnfolder]: 812/1372 cut-off events. [2023-01-27 18:21:02,357 INFO L131 PetriNetUnfolder]: For 4379/4423 co-relation queries the response was YES. [2023-01-27 18:21:02,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6339 conditions, 1372 events. 812/1372 cut-off events. For 4379/4423 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7099 event pairs, 58 based on Foata normal form. 72/1429 useless extension candidates. Maximal degree in co-relation 6308. Up to 496 conditions per place. [2023-01-27 18:21:02,362 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 65 selfloop transitions, 17 changer transitions 39/122 dead transitions. [2023-01-27 18:21:02,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 1133 flow [2023-01-27 18:21:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:21:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:21:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1058 transitions. [2023-01-27 18:21:02,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311244979919679 [2023-01-27 18:21:02,365 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1058 transitions. [2023-01-27 18:21:02,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1058 transitions. [2023-01-27 18:21:02,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:21:02,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1058 transitions. [2023-01-27 18:21:02,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:02,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:02,369 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:21:02,369 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 403 flow. Second operand 8 states and 1058 transitions. [2023-01-27 18:21:02,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 1133 flow [2023-01-27 18:21:02,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 122 transitions, 999 flow, removed 31 selfloop flow, removed 11 redundant places. [2023-01-27 18:21:02,387 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 308 flow [2023-01-27 18:21:02,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=308, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2023-01-27 18:21:02,387 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2023-01-27 18:21:02,388 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 308 flow [2023-01-27 18:21:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-27 18:21:02,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:21:02,388 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] [2023-01-27 18:21:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:21:02,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 18:21:02,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:21:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -796204519, now seen corresponding path program 1 times [2023-01-27 18:21:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:21:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72203617] [2023-01-27 18:21:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:21:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:21:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:02,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:21:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:21:02,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:21:02,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:21:02,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-27 18:21:02,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-27 18:21:02,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-27 18:21:02,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-27 18:21:02,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-27 18:21:02,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:21:02,515 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:21:02,518 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:21:02,519 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:21:02,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:21:02 BasicIcfg [2023-01-27 18:21:02,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:21:02,602 INFO L158 Benchmark]: Toolchain (without parser) took 14516.67ms. Allocated memory was 589.3MB in the beginning and 1.2GB in the end (delta: 591.4MB). Free memory was 544.2MB in the beginning and 593.6MB in the end (delta: -49.4MB). Peak memory consumption was 543.8MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,602 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 286.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:21:02,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 589.3MB. Free memory was 544.2MB in the beginning and 519.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.15ms. Allocated memory is still 589.3MB. Free memory was 519.5MB in the beginning and 517.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,603 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 589.3MB. Free memory was 517.1MB in the beginning and 514.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,603 INFO L158 Benchmark]: RCFGBuilder took 710.51ms. Allocated memory is still 589.3MB. Free memory was 514.6MB in the beginning and 514.3MB in the end (delta: 333.1kB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,603 INFO L158 Benchmark]: TraceAbstraction took 13273.78ms. Allocated memory was 589.3MB in the beginning and 1.2GB in the end (delta: 591.4MB). Free memory was 513.2MB in the beginning and 593.6MB in the end (delta: -80.3MB). Peak memory consumption was 510.0MB. Max. memory is 16.0GB. [2023-01-27 18:21:02,604 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 286.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 589.3MB. Free memory was 544.2MB in the beginning and 519.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.15ms. Allocated memory is still 589.3MB. Free memory was 519.5MB in the beginning and 517.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 589.3MB. Free memory was 517.1MB in the beginning and 514.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 710.51ms. Allocated memory is still 589.3MB. Free memory was 514.6MB in the beginning and 514.3MB in the end (delta: 333.1kB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. * TraceAbstraction took 13273.78ms. Allocated memory was 589.3MB in the beginning and 1.2GB in the end (delta: 591.4MB). Free memory was 513.2MB in the beginning and 593.6MB in the end (delta: -80.3MB). Peak memory consumption was 510.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 137 PlacesBefore, 35 PlacesAfterwards, 125 TransitionsBefore, 22 TransitionsAfterwards, 1654 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 3631 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1601, independent: 1449, independent conditional: 0, independent unconditional: 1449, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 871, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1601, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 871, unknown conditional: 0, unknown unconditional: 871] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L863] 0 pthread_t t2433; [L864] FCALL, FORK 0 pthread_create(&t2433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2433, ((void *)0), P0, ((void *)0))=-3, t2433={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] 0 pthread_t t2434; [L866] FCALL, FORK 0 pthread_create(&t2434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2434, ((void *)0), P1, ((void *)0))=-2, t2433={7:0}, t2434={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L867] 0 pthread_t t2435; [L868] FCALL, FORK 0 pthread_create(&t2435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2435, ((void *)0), P2, ((void *)0))=-1, t2433={7:0}, t2434={8:0}, t2435={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L869] 0 pthread_t t2436; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] EXPR 1 \read(y) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L773] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L774] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L775] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L776] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L778] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L780] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L781] EXPR 1 \read(y) [L781] 1 __unbuffered_p0_EAX = y [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] EXPR 1 \read(y) [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] 1 y = y$flush_delayed ? y$mem_tmp : y [L783] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L786] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] FCALL, FORK 0 pthread_create(&t2436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, pthread_create(&t2436, ((void *)0), P3, ((void *)0))=0, t2433={7:0}, t2434={8:0}, t2435={9:0}, t2436={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L814] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L815] 3 y$flush_delayed = weak$$choice2 [L816] EXPR 3 \read(y) [L816] 3 y$mem_tmp = y [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 \read(y) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L819] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L820] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L821] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L823] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 \read(y) [L824] 3 __unbuffered_p2_EBX = y [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] 3 y = y$flush_delayed ? y$mem_tmp : y [L826] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 \read(y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, main$tmp_guard1=0, t2433={7:0}, t2434={8:0}, t2435={9:0}, t2436={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 870]: 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: 864]: 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: 866]: 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: 868]: 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, 173 locations, 5 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: 13.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 378 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 978 IncrementalHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1 mSDtfsCounter, 978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=10, InterpolantAutomatonStates: 57, 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.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:21:02,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...