/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/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:14:37,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:14:37,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:14:37,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:14:37,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:14:37,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:14:37,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:14:37,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:14:37,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:14:37,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:14:37,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:14:37,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:14:37,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:14:37,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:14:37,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:14:37,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:14:37,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:14:37,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:14:37,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:14:37,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:14:37,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:14:37,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:14:37,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:14:37,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:14:37,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:14:37,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:14:37,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:14:37,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:14:37,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:14:37,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:14:37,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:14:37,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:14:37,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:14:37,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:14:37,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:14:37,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:14:37,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:14:37,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:14:37,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:14:37,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:14:37,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:14:37,417 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:14:37,435 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:14:37,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:14:37,436 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:14:37,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:14:37,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:14:37,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:14:37,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:14:37,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:14:37,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:37,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:14:37,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:14:37,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:14:37,440 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:14:37,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:14:37,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:14:37,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:14:37,715 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:14:37,715 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:14:37,716 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:38,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:14:39,219 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:14:39,220 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:39,235 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59324638e/5c9674a18cc442358168f434a24bafc2/FLAGe4aacf3d3 [2023-01-27 18:14:39,539 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59324638e/5c9674a18cc442358168f434a24bafc2 [2023-01-27 18:14:39,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:14:39,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:14:39,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:39,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:14:39,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:14:39,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:39" (1/1) ... [2023-01-27 18:14:39,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f75630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:39, skipping insertion in model container [2023-01-27 18:14:39,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:39" (1/1) ... [2023-01-27 18:14:39,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:14:39,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:14:39,768 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:14:39,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:39,982 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:14:39,992 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:14:40,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:40,052 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:40,053 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:40,059 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:14:40,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40 WrapperNode [2023-01-27 18:14:40,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:40,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:40,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:14:40,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:14:40,067 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:14:40" (1/1) ... [2023-01-27 18:14:40,097 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:14:40" (1/1) ... [2023-01-27 18:14:40,132 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-01-27 18:14:40,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:40,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:14:40,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:14:40,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:14:40,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,166 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:14:40,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:14:40,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:14:40,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:14:40,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (1/1) ... [2023-01-27 18:14:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:14:40,222 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:14:40,244 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:14:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:14:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:14:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:14:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:14:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:14:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:14:40,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:14:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:14:40,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:14:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:14:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:14:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:14:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:14:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:14:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:14:40,262 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:14:40,405 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:14:40,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:14:40,731 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:14:40,950 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:14:40,951 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:14:40,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:40 BoogieIcfgContainer [2023-01-27 18:14:40,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:14:40,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:14:40,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:14:40,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:14:40,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:14:39" (1/3) ... [2023-01-27 18:14:40,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6674e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:40, skipping insertion in model container [2023-01-27 18:14:40,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:40" (2/3) ... [2023-01-27 18:14:40,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6674e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:40, skipping insertion in model container [2023-01-27 18:14:40,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:40" (3/3) ... [2023-01-27 18:14:40,962 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:40,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:14:40,976 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:14:40,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:14:41,042 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:14:41,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:14:41,135 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:14:41,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:41,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:14:41,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:14:41,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-27 18:14:41,149 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:14:41,163 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:14:41,165 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:14:41,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-27 18:14:41,191 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:14:41,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-27 18:14:41,193 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-27 18:14:44,174 INFO L134 LiptonReduction]: Checked pairs total: 5011 [2023-01-27 18:14:44,175 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-01-27 18:14:44,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:14:44,193 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;@19cd0a77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:14:44,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:14:44,195 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-27 18:14:44,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:44,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:44,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:14:44,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:44,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 464885, now seen corresponding path program 1 times [2023-01-27 18:14:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:44,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831875514] [2023-01-27 18:14:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:44,548 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:14:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831875514] [2023-01-27 18:14:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831875514] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007011129] [2023-01-27 18:14:44,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:44,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:44,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 196 [2023-01-27 18:14:44,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:14:44,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:44,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 196 [2023-01-27 18:14:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:44,938 INFO L130 PetriNetUnfolder]: 1263/2016 cut-off events. [2023-01-27 18:14:44,938 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-27 18:14:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2016 events. 1263/2016 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10920 event pairs, 204 based on Foata normal form. 80/1935 useless extension candidates. Maximal degree in co-relation 3916. Up to 1510 conditions per place. [2023-01-27 18:14:44,956 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 33 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-01-27 18:14:44,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2023-01-27 18:14:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-01-27 18:14:44,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2023-01-27 18:14:44,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-01-27 18:14:44,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-01-27 18:14:44,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:44,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-01-27 18:14:44,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:14:44,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:14:44,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:14:44,992 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 321 transitions. [2023-01-27 18:14:44,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2023-01-27 18:14:44,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:44,996 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-27 18:14:44,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 18:14:45,003 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-27 18:14:45,004 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-27 18:14:45,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:14:45,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:45,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:45,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:14:45,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:45,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash 682702742, now seen corresponding path program 1 times [2023-01-27 18:14:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751391702] [2023-01-27 18:14:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:45,400 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:14:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751391702] [2023-01-27 18:14:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751391702] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:45,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953979332] [2023-01-27 18:14:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:45,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:45,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-27 18:14:45,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:14:45,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:45,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-27 18:14:45,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:45,970 INFO L130 PetriNetUnfolder]: 2646/3975 cut-off events. [2023-01-27 18:14:45,971 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2023-01-27 18:14:45,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8254 conditions, 3975 events. 2646/3975 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20376 event pairs, 793 based on Foata normal form. 212/4187 useless extension candidates. Maximal degree in co-relation 8244. Up to 1747 conditions per place. [2023-01-27 18:14:45,991 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 33 selfloop transitions, 6 changer transitions 25/64 dead transitions. [2023-01-27 18:14:45,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 274 flow [2023-01-27 18:14:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-01-27 18:14:45,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-01-27 18:14:45,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-01-27 18:14:45,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-01-27 18:14:45,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:45,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-01-27 18:14:45,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:14:45,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:14:45,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:14:46,000 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 476 transitions. [2023-01-27 18:14:46,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 274 flow [2023-01-27 18:14:46,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:46,002 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 110 flow [2023-01-27 18:14:46,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-01-27 18:14:46,003 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-01-27 18:14:46,003 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 110 flow [2023-01-27 18:14:46,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:14:46,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:46,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:46,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:14:46,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:46,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:46,007 INFO L85 PathProgramCache]: Analyzing trace with hash -311073050, now seen corresponding path program 1 times [2023-01-27 18:14:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086691239] [2023-01-27 18:14:46,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:46,190 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:14:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086691239] [2023-01-27 18:14:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086691239] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514725323] [2023-01-27 18:14:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:46,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:46,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-27 18:14:46,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:14:46,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:46,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-27 18:14:46,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:46,725 INFO L130 PetriNetUnfolder]: 2387/3633 cut-off events. [2023-01-27 18:14:46,725 INFO L131 PetriNetUnfolder]: For 2776/2776 co-relation queries the response was YES. [2023-01-27 18:14:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 3633 events. 2387/3633 cut-off events. For 2776/2776 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18534 event pairs, 221 based on Foata normal form. 175/3808 useless extension candidates. Maximal degree in co-relation 9839. Up to 1625 conditions per place. [2023-01-27 18:14:46,746 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 40 selfloop transitions, 10 changer transitions 30/80 dead transitions. [2023-01-27 18:14:46,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 456 flow [2023-01-27 18:14:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2023-01-27 18:14:46,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752186588921283 [2023-01-27 18:14:46,750 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2023-01-27 18:14:46,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2023-01-27 18:14:46,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:46,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2023-01-27 18:14:46,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:14:46,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:46,755 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:46,755 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 110 flow. Second operand 7 states and 652 transitions. [2023-01-27 18:14:46,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 80 transitions, 456 flow [2023-01-27 18:14:46,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 80 transitions, 418 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:46,768 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 176 flow [2023-01-27 18:14:46,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-01-27 18:14:46,770 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-01-27 18:14:46,772 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 176 flow [2023-01-27 18:14:46,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:14:46,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:46,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:46,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:14:46,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:46,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -311077855, now seen corresponding path program 1 times [2023-01-27 18:14:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136243518] [2023-01-27 18:14:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:46,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:14:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136243518] [2023-01-27 18:14:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136243518] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:46,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73661049] [2023-01-27 18:14:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:46,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:46,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-27 18:14:46,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:14:46,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:46,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-27 18:14:46,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:47,536 INFO L130 PetriNetUnfolder]: 2285/3482 cut-off events. [2023-01-27 18:14:47,536 INFO L131 PetriNetUnfolder]: For 7909/7909 co-relation queries the response was YES. [2023-01-27 18:14:47,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10643 conditions, 3482 events. 2285/3482 cut-off events. For 7909/7909 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17625 event pairs, 346 based on Foata normal form. 166/3648 useless extension candidates. Maximal degree in co-relation 10623. Up to 1551 conditions per place. [2023-01-27 18:14:47,554 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 45 selfloop transitions, 14 changer transitions 29/88 dead transitions. [2023-01-27 18:14:47,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 570 flow [2023-01-27 18:14:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:47,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-01-27 18:14:47,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2023-01-27 18:14:47,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-01-27 18:14:47,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-01-27 18:14:47,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:47,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-01-27 18:14:47,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:14:47,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:47,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:47,562 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 176 flow. Second operand 7 states and 658 transitions. [2023-01-27 18:14:47,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 570 flow [2023-01-27 18:14:47,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 554 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:47,578 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 262 flow [2023-01-27 18:14:47,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-01-27 18:14:47,579 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:14:47,579 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 262 flow [2023-01-27 18:14:47,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:14:47,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:47,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:47,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:14:47,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:47,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1053356335, now seen corresponding path program 1 times [2023-01-27 18:14:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637754057] [2023-01-27 18:14:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:47,762 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:14:47,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637754057] [2023-01-27 18:14:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637754057] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:47,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392985205] [2023-01-27 18:14:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:47,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-27 18:14:47,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:14:47,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:47,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-27 18:14:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:47,976 INFO L130 PetriNetUnfolder]: 822/1426 cut-off events. [2023-01-27 18:14:47,976 INFO L131 PetriNetUnfolder]: For 2932/2990 co-relation queries the response was YES. [2023-01-27 18:14:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 1426 events. 822/1426 cut-off events. For 2932/2990 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7250 event pairs, 191 based on Foata normal form. 115/1536 useless extension candidates. Maximal degree in co-relation 4525. Up to 1146 conditions per place. [2023-01-27 18:14:47,986 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-01-27 18:14:47,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 470 flow [2023-01-27 18:14:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-01-27 18:14:47,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2023-01-27 18:14:47,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-01-27 18:14:47,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-01-27 18:14:47,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:47,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-01-27 18:14:47,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:14:47,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:14:47,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:14:47,993 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 262 flow. Second operand 3 states and 302 transitions. [2023-01-27 18:14:47,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 470 flow [2023-01-27 18:14:48,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 454 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:48,001 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 274 flow [2023-01-27 18:14:48,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-01-27 18:14:48,004 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-01-27 18:14:48,004 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 274 flow [2023-01-27 18:14:48,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:14:48,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:48,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:48,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:14:48,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:48,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1259387927, now seen corresponding path program 1 times [2023-01-27 18:14:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105727744] [2023-01-27 18:14:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:48,215 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:14:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105727744] [2023-01-27 18:14:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105727744] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:48,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726590542] [2023-01-27 18:14:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:48,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:48,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-27 18:14:48,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 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:14:48,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:48,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-27 18:14:48,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:48,648 INFO L130 PetriNetUnfolder]: 1446/2457 cut-off events. [2023-01-27 18:14:48,648 INFO L131 PetriNetUnfolder]: For 4848/4848 co-relation queries the response was YES. [2023-01-27 18:14:48,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8482 conditions, 2457 events. 1446/2457 cut-off events. For 4848/4848 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13507 event pairs, 315 based on Foata normal form. 87/2544 useless extension candidates. Maximal degree in co-relation 8458. Up to 973 conditions per place. [2023-01-27 18:14:48,665 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 55 selfloop transitions, 14 changer transitions 32/101 dead transitions. [2023-01-27 18:14:48,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 751 flow [2023-01-27 18:14:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-01-27 18:14:48,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47886297376093295 [2023-01-27 18:14:48,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-01-27 18:14:48,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-01-27 18:14:48,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:48,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-01-27 18:14:48,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:14:48,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:48,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states 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:14:48,673 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 274 flow. Second operand 7 states and 657 transitions. [2023-01-27 18:14:48,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 751 flow [2023-01-27 18:14:48,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 739 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:48,681 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 318 flow [2023-01-27 18:14:48,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-01-27 18:14:48,683 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-01-27 18:14:48,683 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 318 flow [2023-01-27 18:14:48,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 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:14:48,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:48,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:48,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:14:48,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:48,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 207113669, now seen corresponding path program 1 times [2023-01-27 18:14:48,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:48,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295949043] [2023-01-27 18:14:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:48,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:48,925 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:14:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295949043] [2023-01-27 18:14:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295949043] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:48,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128558483] [2023-01-27 18:14:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:48,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:48,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:48,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:48,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-27 18:14:48,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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:14:48,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:48,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-27 18:14:48,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:49,094 INFO L130 PetriNetUnfolder]: 453/890 cut-off events. [2023-01-27 18:14:49,094 INFO L131 PetriNetUnfolder]: For 1920/1944 co-relation queries the response was YES. [2023-01-27 18:14:49,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 890 events. 453/890 cut-off events. For 1920/1944 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4652 event pairs, 120 based on Foata normal form. 119/1000 useless extension candidates. Maximal degree in co-relation 3108. Up to 311 conditions per place. [2023-01-27 18:14:49,100 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 57 selfloop transitions, 7 changer transitions 1/72 dead transitions. [2023-01-27 18:14:49,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 682 flow [2023-01-27 18:14:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:14:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:14:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2023-01-27 18:14:49,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514030612244898 [2023-01-27 18:14:49,102 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2023-01-27 18:14:49,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2023-01-27 18:14:49,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:49,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2023-01-27 18:14:49,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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:14:49,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:14:49,105 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:14:49,105 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 318 flow. Second operand 4 states and 403 transitions. [2023-01-27 18:14:49,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 682 flow [2023-01-27 18:14:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 643 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:49,111 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 333 flow [2023-01-27 18:14:49,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-01-27 18:14:49,112 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-01-27 18:14:49,112 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 333 flow [2023-01-27 18:14:49,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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:14:49,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:49,112 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:14:49,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:14:49,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:49,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1666297553, now seen corresponding path program 1 times [2023-01-27 18:14:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591462203] [2023-01-27 18:14:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:49,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591462203] [2023-01-27 18:14:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591462203] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:49,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146867649] [2023-01-27 18:14:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:49,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:49,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-27 18:14:49,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 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:14:49,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:49,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-27 18:14:49,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:49,557 INFO L130 PetriNetUnfolder]: 369/704 cut-off events. [2023-01-27 18:14:49,557 INFO L131 PetriNetUnfolder]: For 1660/1675 co-relation queries the response was YES. [2023-01-27 18:14:49,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 704 events. 369/704 cut-off events. For 1660/1675 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3557 event pairs, 106 based on Foata normal form. 50/745 useless extension candidates. Maximal degree in co-relation 2739. Up to 285 conditions per place. [2023-01-27 18:14:49,564 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 45 selfloop transitions, 10 changer transitions 13/72 dead transitions. [2023-01-27 18:14:49,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 671 flow [2023-01-27 18:14:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-27 18:14:49,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2023-01-27 18:14:49,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-27 18:14:49,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-27 18:14:49,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:49,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-27 18:14:49,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:14:49,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:14:49,570 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:14:49,570 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 333 flow. Second operand 5 states and 492 transitions. [2023-01-27 18:14:49,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 671 flow [2023-01-27 18:14:49,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 641 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:49,575 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 277 flow [2023-01-27 18:14:49,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2023-01-27 18:14:49,577 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2023-01-27 18:14:49,578 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 277 flow [2023-01-27 18:14:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 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:14:49,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:49,578 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:14:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:14:49,578 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:49,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1851954665, now seen corresponding path program 1 times [2023-01-27 18:14:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548332396] [2023-01-27 18:14:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:50,528 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:14:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:50,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548332396] [2023-01-27 18:14:50,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548332396] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:50,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:14:50,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339106337] [2023-01-27 18:14:50,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:14:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:14:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:14:50,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 196 [2023-01-27 18:14:50,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 277 flow. Second operand has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:14:50,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:50,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 196 [2023-01-27 18:14:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:50,871 INFO L130 PetriNetUnfolder]: 296/562 cut-off events. [2023-01-27 18:14:50,871 INFO L131 PetriNetUnfolder]: For 1765/1765 co-relation queries the response was YES. [2023-01-27 18:14:50,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 562 events. 296/562 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2457 event pairs, 19 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 2357. Up to 158 conditions per place. [2023-01-27 18:14:50,874 INFO L137 encePairwiseOnDemand]: 184/196 looper letters, 34 selfloop transitions, 14 changer transitions 71/119 dead transitions. [2023-01-27 18:14:50,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 1071 flow [2023-01-27 18:14:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:14:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:14:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 838 transitions. [2023-01-27 18:14:50,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275510204081633 [2023-01-27 18:14:50,877 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 838 transitions. [2023-01-27 18:14:50,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 838 transitions. [2023-01-27 18:14:50,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:50,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 838 transitions. [2023-01-27 18:14:50,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.8) internal successors, (838), 10 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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:14:50,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states 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:14:50,884 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states 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:14:50,884 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 277 flow. Second operand 10 states and 838 transitions. [2023-01-27 18:14:50,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 1071 flow [2023-01-27 18:14:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 119 transitions, 869 flow, removed 28 selfloop flow, removed 11 redundant places. [2023-01-27 18:14:50,892 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 285 flow [2023-01-27 18:14:50,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=285, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-01-27 18:14:50,893 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-01-27 18:14:50,893 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 285 flow [2023-01-27 18:14:50,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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:14:50,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:50,894 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:14:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:14:50,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:14:50,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2043530527, now seen corresponding path program 2 times [2023-01-27 18:14:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533119206] [2023-01-27 18:14:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:50,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:14:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:51,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:14:51,043 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:14:51,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:14:51,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:14:51,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:14:51,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:14:51,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:14:51,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:14:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:14:51,047 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:51,052 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:14:51,052 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:14:51,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:14:51 BasicIcfg [2023-01-27 18:14:51,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:14:51,128 INFO L158 Benchmark]: Toolchain (without parser) took 11585.38ms. Allocated memory was 551.6MB in the beginning and 799.0MB in the end (delta: 247.5MB). Free memory was 510.6MB in the beginning and 334.5MB in the end (delta: 176.2MB). Peak memory consumption was 425.2MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,128 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 364.9MB. Free memory is still 314.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:14:51,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.57ms. Allocated memory is still 551.6MB. Free memory was 510.3MB in the beginning and 487.3MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.19ms. Allocated memory is still 551.6MB. Free memory was 487.3MB in the beginning and 484.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,133 INFO L158 Benchmark]: Boogie Preprocessor took 52.44ms. Allocated memory is still 551.6MB. Free memory was 484.9MB in the beginning and 483.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,133 INFO L158 Benchmark]: RCFGBuilder took 766.18ms. Allocated memory is still 551.6MB. Free memory was 483.0MB in the beginning and 515.9MB in the end (delta: -32.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,133 INFO L158 Benchmark]: TraceAbstraction took 10172.18ms. Allocated memory was 551.6MB in the beginning and 799.0MB in the end (delta: 247.5MB). Free memory was 514.9MB in the beginning and 334.5MB in the end (delta: 180.4MB). Peak memory consumption was 426.8MB. Max. memory is 16.0GB. [2023-01-27 18:14:51,135 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.13ms. Allocated memory is still 364.9MB. Free memory is still 314.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 506.57ms. Allocated memory is still 551.6MB. Free memory was 510.3MB in the beginning and 487.3MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.19ms. Allocated memory is still 551.6MB. Free memory was 487.3MB in the beginning and 484.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.44ms. Allocated memory is still 551.6MB. Free memory was 484.9MB in the beginning and 483.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 766.18ms. Allocated memory is still 551.6MB. Free memory was 483.0MB in the beginning and 515.9MB in the end (delta: -32.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.0GB. * TraceAbstraction took 10172.18ms. Allocated memory was 551.6MB in the beginning and 799.0MB in the end (delta: 247.5MB). Free memory was 514.9MB in the beginning and 334.5MB in the end (delta: 180.4MB). Peak memory consumption was 426.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 5011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2105, independent: 1940, independent conditional: 0, independent unconditional: 1940, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1022, independent: 988, independent conditional: 0, independent unconditional: 988, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2105, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-1, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=1, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 25 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:14:51,161 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...