/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:00:11,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:00:11,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:00:11,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:00:11,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:00:11,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:00:11,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:00:11,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:00:11,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:00:11,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:00:11,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:00:11,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:00:11,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:00:11,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:00:11,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:00:11,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:00:11,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:00:11,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:00:11,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:00:11,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:00:11,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:00:11,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:00:11,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:00:11,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:00:11,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:00:11,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:00:11,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:00:11,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:00:11,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:00:11,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:00:11,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:00:11,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:00:11,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:00:11,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:00:11,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:00:11,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:00:11,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:00:11,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:00:11,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:00:11,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:00:11,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:00:11,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:00:11,556 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:00:11,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:00:11,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:00:11,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:00:11,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:00:11,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:00:11,558 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:00:11,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:00:11,558 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:00:11,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:00:11,559 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:00:11,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:00:11,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:00:11,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:00:11,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:00:11,561 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:00:11,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:00:11,561 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:00:11,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:00:11,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:00:11,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:00:11,745 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:00:11,745 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:00:11,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-01-28 07:00:12,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:00:12,914 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:00:12,914 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-01-28 07:00:12,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f5e2398/04f5a225e8cc413f973cee2fd47af450/FLAGcb4d36b8e [2023-01-28 07:00:12,935 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f5e2398/04f5a225e8cc413f973cee2fd47af450 [2023-01-28 07:00:12,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:00:12,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:00:12,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:00:12,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:00:12,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:00:12,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:00:12" (1/1) ... [2023-01-28 07:00:12,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1437d334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:12, skipping insertion in model container [2023-01-28 07:00:12,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:00:12" (1/1) ... [2023-01-28 07:00:12,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:00:12,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:00:13,070 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-28 07:00:13,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:00:13,239 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:00:13,249 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2023-01-28 07:00:13,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:00:13,329 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:00:13,329 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:00:13,334 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:00:13,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13 WrapperNode [2023-01-28 07:00:13,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:00:13,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:00:13,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:00:13,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:00:13,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,381 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 07:00:13,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:00:13,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:00:13,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:00:13,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:00:13,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,424 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:00:13,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:00:13,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:00:13,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:00:13,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (1/1) ... [2023-01-28 07:00:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:00:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:00:13,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 07:00:13,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 07:00:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:00:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:00:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:00:13,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:00:13,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:00:13,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:00:13,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:00:13,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:00:13,507 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:00:13,594 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:00:13,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:00:13,914 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:00:14,016 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:00:14,016 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:00:14,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:00:14 BoogieIcfgContainer [2023-01-28 07:00:14,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:00:14,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:00:14,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:00:14,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:00:14,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:00:12" (1/3) ... [2023-01-28 07:00:14,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d0607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:00:14, skipping insertion in model container [2023-01-28 07:00:14,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:00:13" (2/3) ... [2023-01-28 07:00:14,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8d0607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:00:14, skipping insertion in model container [2023-01-28 07:00:14,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:00:14" (3/3) ... [2023-01-28 07:00:14,023 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-01-28 07:00:14,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:00:14,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:00:14,043 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:00:14,098 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:00:14,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 07:00:14,172 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 07:00:14,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:14,176 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 54 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-28 07:00:14,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 07:00:14,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-28 07:00:14,184 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:00:14,190 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 07:00:14,192 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 07:00:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-28 07:00:14,211 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 07:00:14,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:14,211 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 54 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-28 07:00:14,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 1906 [2023-01-28 07:00:17,851 INFO L134 LiptonReduction]: Checked pairs total: 4689 [2023-01-28 07:00:17,851 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-01-28 07:00:17,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:00:17,867 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;@117226d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:00:17,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 07:00:17,870 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-28 07:00:17,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:00:17,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:17,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 07:00:17,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:17,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash 449581389, now seen corresponding path program 1 times [2023-01-28 07:00:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:17,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033037200] [2023-01-28 07:00:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:18,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033037200] [2023-01-28 07:00:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033037200] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:18,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:18,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:00:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106975410] [2023-01-28 07:00:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:00:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:18,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:00:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:00:18,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 199 [2023-01-28 07:00:18,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:18,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:18,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 199 [2023-01-28 07:00:18,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:18,449 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2023-01-28 07:00:18,449 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 07:00:18,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5923 event pairs, 117 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 859 conditions per place. [2023-01-28 07:00:18,459 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-01-28 07:00:18,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 142 flow [2023-01-28 07:00:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:00:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:00:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-01-28 07:00:18,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209380234505863 [2023-01-28 07:00:18,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-01-28 07:00:18,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-01-28 07:00:18,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:18,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-01-28 07:00:18,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:18,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:18,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:18,488 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 311 transitions. [2023-01-28 07:00:18,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 142 flow [2023-01-28 07:00:18,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:18,497 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-28 07:00:18,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-28 07:00:18,500 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-28 07:00:18,501 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-28 07:00:18,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:18,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:18,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:00:18,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:18,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash -880810399, now seen corresponding path program 1 times [2023-01-28 07:00:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:18,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748046812] [2023-01-28 07:00:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748046812] [2023-01-28 07:00:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748046812] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:00:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993699365] [2023-01-28 07:00:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:19,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:00:19,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:19,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:00:19,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:19,275 INFO L130 PetriNetUnfolder]: 1536/2284 cut-off events. [2023-01-28 07:00:19,275 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-01-28 07:00:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2284 events. 1536/2284 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9981 event pairs, 209 based on Foata normal form. 85/2369 useless extension candidates. Maximal degree in co-relation 4760. Up to 1396 conditions per place. [2023-01-28 07:00:19,288 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 34 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2023-01-28 07:00:19,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 190 flow [2023-01-28 07:00:19,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:00:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:00:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-01-28 07:00:19,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547738693467337 [2023-01-28 07:00:19,291 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-01-28 07:00:19,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-01-28 07:00:19,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:19,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-01-28 07:00:19,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,296 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,296 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 362 transitions. [2023-01-28 07:00:19,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 190 flow [2023-01-28 07:00:19,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:00:19,299 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 124 flow [2023-01-28 07:00:19,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-01-28 07:00:19,300 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-01-28 07:00:19,300 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 124 flow [2023-01-28 07:00:19,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:19,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:19,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:00:19,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:19,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1535368224, now seen corresponding path program 1 times [2023-01-28 07:00:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906098524] [2023-01-28 07:00:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906098524] [2023-01-28 07:00:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906098524] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:00:19,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423652798] [2023-01-28 07:00:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:19,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:19,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:19,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:00:19,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:19,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:00:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:19,938 INFO L130 PetriNetUnfolder]: 1431/2129 cut-off events. [2023-01-28 07:00:19,939 INFO L131 PetriNetUnfolder]: For 919/919 co-relation queries the response was YES. [2023-01-28 07:00:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6300 conditions, 2129 events. 1431/2129 cut-off events. For 919/919 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9114 event pairs, 376 based on Foata normal form. 25/2154 useless extension candidates. Maximal degree in co-relation 6287. Up to 1068 conditions per place. [2023-01-28 07:00:19,950 INFO L137 encePairwiseOnDemand]: 189/199 looper letters, 40 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2023-01-28 07:00:19,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 302 flow [2023-01-28 07:00:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:00:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:00:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2023-01-28 07:00:19,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45226130653266333 [2023-01-28 07:00:19,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 360 transitions. [2023-01-28 07:00:19,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 360 transitions. [2023-01-28 07:00:19,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:19,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 360 transitions. [2023-01-28 07:00:19,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:19,998 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 124 flow. Second operand 4 states and 360 transitions. [2023-01-28 07:00:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 302 flow [2023-01-28 07:00:20,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:00:20,001 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 212 flow [2023-01-28 07:00:20,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-01-28 07:00:20,003 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-28 07:00:20,005 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 212 flow [2023-01-28 07:00:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:20,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:20,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:00:20,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:20,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -390290266, now seen corresponding path program 1 times [2023-01-28 07:00:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295409857] [2023-01-28 07:00:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:20,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295409857] [2023-01-28 07:00:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295409857] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:20,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:20,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:00:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92263946] [2023-01-28 07:00:20,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:20,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:20,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:00:20,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:20,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:00:20,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:20,886 INFO L130 PetriNetUnfolder]: 2158/3219 cut-off events. [2023-01-28 07:00:20,886 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2023-01-28 07:00:20,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11102 conditions, 3219 events. 2158/3219 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15548 event pairs, 255 based on Foata normal form. 75/3294 useless extension candidates. Maximal degree in co-relation 11085. Up to 1524 conditions per place. [2023-01-28 07:00:20,899 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 41 selfloop transitions, 18 changer transitions 30/89 dead transitions. [2023-01-28 07:00:20,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 89 transitions, 707 flow [2023-01-28 07:00:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-01-28 07:00:20,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592964824120603 [2023-01-28 07:00:20,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-01-28 07:00:20,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-01-28 07:00:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:20,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-01-28 07:00:20,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,910 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 212 flow. Second operand 5 states and 457 transitions. [2023-01-28 07:00:20,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 89 transitions, 707 flow [2023-01-28 07:00:20,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 89 transitions, 695 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 07:00:20,931 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 263 flow [2023-01-28 07:00:20,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-28 07:00:20,931 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-01-28 07:00:20,932 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 263 flow [2023-01-28 07:00:20,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:20,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:20,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:20,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:00:20,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:20,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1977339290, now seen corresponding path program 1 times [2023-01-28 07:00:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328209547] [2023-01-28 07:00:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328209547] [2023-01-28 07:00:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328209547] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:21,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819308886] [2023-01-28 07:00:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:21,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-01-28 07:00:21,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:21,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:21,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-01-28 07:00:21,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:22,002 INFO L130 PetriNetUnfolder]: 2433/3677 cut-off events. [2023-01-28 07:00:22,003 INFO L131 PetriNetUnfolder]: For 4542/4542 co-relation queries the response was YES. [2023-01-28 07:00:22,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 3677 events. 2433/3677 cut-off events. For 4542/4542 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18694 event pairs, 197 based on Foata normal form. 96/3773 useless extension candidates. Maximal degree in co-relation 13124. Up to 1614 conditions per place. [2023-01-28 07:00:22,016 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 43 selfloop transitions, 27 changer transitions 44/114 dead transitions. [2023-01-28 07:00:22,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 114 transitions, 928 flow [2023-01-28 07:00:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:00:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:00:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 639 transitions. [2023-01-28 07:00:22,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587221823402728 [2023-01-28 07:00:22,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 639 transitions. [2023-01-28 07:00:22,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 639 transitions. [2023-01-28 07:00:22,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:22,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 639 transitions. [2023-01-28 07:00:22,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,022 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,023 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 263 flow. Second operand 7 states and 639 transitions. [2023-01-28 07:00:22,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 114 transitions, 928 flow [2023-01-28 07:00:22,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 114 transitions, 842 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:22,045 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 406 flow [2023-01-28 07:00:22,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-01-28 07:00:22,047 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-01-28 07:00:22,047 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 406 flow [2023-01-28 07:00:22,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:22,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:22,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:00:22,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:22,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:22,049 INFO L85 PathProgramCache]: Analyzing trace with hash 326885560, now seen corresponding path program 1 times [2023-01-28 07:00:22,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:22,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279689722] [2023-01-28 07:00:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279689722] [2023-01-28 07:00:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279689722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:00:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889049769] [2023-01-28 07:00:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:22,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:22,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-01-28 07:00:22,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:22,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-01-28 07:00:22,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:22,790 INFO L130 PetriNetUnfolder]: 1126/1785 cut-off events. [2023-01-28 07:00:22,790 INFO L131 PetriNetUnfolder]: For 4085/4088 co-relation queries the response was YES. [2023-01-28 07:00:22,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1785 events. 1126/1785 cut-off events. For 4085/4088 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8437 event pairs, 353 based on Foata normal form. 6/1769 useless extension candidates. Maximal degree in co-relation 7021. Up to 1594 conditions per place. [2023-01-28 07:00:22,801 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-01-28 07:00:22,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 800 flow [2023-01-28 07:00:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:00:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:00:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-01-28 07:00:22,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899497487437186 [2023-01-28 07:00:22,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-01-28 07:00:22,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-01-28 07:00:22,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:22,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-01-28 07:00:22,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,806 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,806 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 406 flow. Second operand 4 states and 390 transitions. [2023-01-28 07:00:22,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 800 flow [2023-01-28 07:00:22,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 760 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-28 07:00:22,821 INFO L231 Difference]: Finished difference. Result has 50 places, 57 transitions, 531 flow [2023-01-28 07:00:22,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=50, PETRI_TRANSITIONS=57} [2023-01-28 07:00:22,822 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-01-28 07:00:22,822 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 57 transitions, 531 flow [2023-01-28 07:00:22,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:22,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:22,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:22,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:00:22,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:22,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 524132965, now seen corresponding path program 1 times [2023-01-28 07:00:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064826978] [2023-01-28 07:00:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064826978] [2023-01-28 07:00:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064826978] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:23,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:23,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040232906] [2023-01-28 07:00:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:00:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:00:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:00:23,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:00:23,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:23,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:23,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:00:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:23,703 INFO L130 PetriNetUnfolder]: 1911/3026 cut-off events. [2023-01-28 07:00:23,703 INFO L131 PetriNetUnfolder]: For 8291/8343 co-relation queries the response was YES. [2023-01-28 07:00:23,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12723 conditions, 3026 events. 1911/3026 cut-off events. For 8291/8343 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16308 event pairs, 385 based on Foata normal form. 65/3045 useless extension candidates. Maximal degree in co-relation 12699. Up to 1631 conditions per place. [2023-01-28 07:00:23,721 INFO L137 encePairwiseOnDemand]: 191/199 looper letters, 107 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2023-01-28 07:00:23,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 150 transitions, 1619 flow [2023-01-28 07:00:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-01-28 07:00:23,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4916247906197655 [2023-01-28 07:00:23,723 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-01-28 07:00:23,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-01-28 07:00:23,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:23,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-01-28 07:00:23,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:23,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:23,726 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:23,726 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 531 flow. Second operand 6 states and 587 transitions. [2023-01-28 07:00:23,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 150 transitions, 1619 flow [2023-01-28 07:00:23,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 150 transitions, 1619 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 07:00:23,739 INFO L231 Difference]: Finished difference. Result has 59 places, 90 transitions, 1079 flow [2023-01-28 07:00:23,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1079, PETRI_PLACES=59, PETRI_TRANSITIONS=90} [2023-01-28 07:00:23,740 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-01-28 07:00:23,740 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 90 transitions, 1079 flow [2023-01-28 07:00:23,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:23,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:23,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:23,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:00:23,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:23,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 524036245, now seen corresponding path program 2 times [2023-01-28 07:00:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108988787] [2023-01-28 07:00:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108988787] [2023-01-28 07:00:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108988787] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723026733] [2023-01-28 07:00:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:24,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:00:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:00:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:00:24,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:00:24,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 90 transitions, 1079 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:24,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:00:24,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:24,469 INFO L130 PetriNetUnfolder]: 2046/3253 cut-off events. [2023-01-28 07:00:24,469 INFO L131 PetriNetUnfolder]: For 15003/15205 co-relation queries the response was YES. [2023-01-28 07:00:24,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16128 conditions, 3253 events. 2046/3253 cut-off events. For 15003/15205 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18017 event pairs, 420 based on Foata normal form. 233/3435 useless extension candidates. Maximal degree in co-relation 16098. Up to 2589 conditions per place. [2023-01-28 07:00:24,488 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 85 selfloop transitions, 38 changer transitions 0/128 dead transitions. [2023-01-28 07:00:24,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 128 transitions, 1637 flow [2023-01-28 07:00:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:00:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:00:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 568 transitions. [2023-01-28 07:00:24,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47571189279731996 [2023-01-28 07:00:24,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 568 transitions. [2023-01-28 07:00:24,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 568 transitions. [2023-01-28 07:00:24,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:24,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 568 transitions. [2023-01-28 07:00:24,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,493 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,493 INFO L175 Difference]: Start difference. First operand has 59 places, 90 transitions, 1079 flow. Second operand 6 states and 568 transitions. [2023-01-28 07:00:24,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 128 transitions, 1637 flow [2023-01-28 07:00:24,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 1615 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-01-28 07:00:24,510 INFO L231 Difference]: Finished difference. Result has 64 places, 103 transitions, 1362 flow [2023-01-28 07:00:24,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1362, PETRI_PLACES=64, PETRI_TRANSITIONS=103} [2023-01-28 07:00:24,511 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2023-01-28 07:00:24,511 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 103 transitions, 1362 flow [2023-01-28 07:00:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:24,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:24,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:00:24,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:24,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -673821146, now seen corresponding path program 1 times [2023-01-28 07:00:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920737672] [2023-01-28 07:00:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920737672] [2023-01-28 07:00:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920737672] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:00:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954324130] [2023-01-28 07:00:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:00:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:00:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:00:24,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:00:24,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 103 transitions, 1362 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:24,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:00:24,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:24,972 INFO L130 PetriNetUnfolder]: 1324/2214 cut-off events. [2023-01-28 07:00:24,972 INFO L131 PetriNetUnfolder]: For 20287/20738 co-relation queries the response was YES. [2023-01-28 07:00:24,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11917 conditions, 2214 events. 1324/2214 cut-off events. For 20287/20738 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 12937 event pairs, 146 based on Foata normal form. 655/2856 useless extension candidates. Maximal degree in co-relation 11885. Up to 1310 conditions per place. [2023-01-28 07:00:24,981 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 147 selfloop transitions, 7 changer transitions 55/217 dead transitions. [2023-01-28 07:00:24,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 217 transitions, 3344 flow [2023-01-28 07:00:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:00:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:00:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-28 07:00:24,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894472361809045 [2023-01-28 07:00:24,983 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-28 07:00:24,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-28 07:00:24,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:24,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-28 07:00:24,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,987 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:24,987 INFO L175 Difference]: Start difference. First operand has 64 places, 103 transitions, 1362 flow. Second operand 5 states and 487 transitions. [2023-01-28 07:00:24,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 217 transitions, 3344 flow [2023-01-28 07:00:25,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 217 transitions, 3147 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-01-28 07:00:25,002 INFO L231 Difference]: Finished difference. Result has 63 places, 93 transitions, 1144 flow [2023-01-28 07:00:25,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1144, PETRI_PLACES=63, PETRI_TRANSITIONS=93} [2023-01-28 07:00:25,003 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2023-01-28 07:00:25,003 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 93 transitions, 1144 flow [2023-01-28 07:00:25,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:25,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:25,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:00:25,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:25,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash 228211204, now seen corresponding path program 1 times [2023-01-28 07:00:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138223558] [2023-01-28 07:00:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138223558] [2023-01-28 07:00:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138223558] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:00:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861043964] [2023-01-28 07:00:25,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:00:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:00:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:00:25,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:00:25,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 93 transitions, 1144 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:25,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:00:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:25,394 INFO L130 PetriNetUnfolder]: 949/1680 cut-off events. [2023-01-28 07:00:25,395 INFO L131 PetriNetUnfolder]: For 15899/16304 co-relation queries the response was YES. [2023-01-28 07:00:25,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9707 conditions, 1680 events. 949/1680 cut-off events. For 15899/16304 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10032 event pairs, 50 based on Foata normal form. 491/2158 useless extension candidates. Maximal degree in co-relation 9677. Up to 825 conditions per place. [2023-01-28 07:00:25,402 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 152 selfloop transitions, 13 changer transitions 58/231 dead transitions. [2023-01-28 07:00:25,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 231 transitions, 3343 flow [2023-01-28 07:00:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:00:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:00:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2023-01-28 07:00:25,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48743718592964824 [2023-01-28 07:00:25,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 679 transitions. [2023-01-28 07:00:25,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 679 transitions. [2023-01-28 07:00:25,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:25,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 679 transitions. [2023-01-28 07:00:25,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,409 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,409 INFO L175 Difference]: Start difference. First operand has 63 places, 93 transitions, 1144 flow. Second operand 7 states and 679 transitions. [2023-01-28 07:00:25,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 231 transitions, 3343 flow [2023-01-28 07:00:25,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 231 transitions, 3339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:00:25,422 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 1120 flow [2023-01-28 07:00:25,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1120, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2023-01-28 07:00:25,424 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2023-01-28 07:00:25,425 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 1120 flow [2023-01-28 07:00:25,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:25,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:25,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:00:25,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:25,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1991755047, now seen corresponding path program 1 times [2023-01-28 07:00:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573646851] [2023-01-28 07:00:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:00:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:00:25,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:00:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573646851] [2023-01-28 07:00:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573646851] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:00:25,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:00:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:00:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942186701] [2023-01-28 07:00:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:00:25,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:00:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:00:25,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:00:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:00:25,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-01-28 07:00:25,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:00:25,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-01-28 07:00:25,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:00:25,886 INFO L130 PetriNetUnfolder]: 856/1518 cut-off events. [2023-01-28 07:00:25,886 INFO L131 PetriNetUnfolder]: For 14351/14697 co-relation queries the response was YES. [2023-01-28 07:00:25,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9383 conditions, 1518 events. 856/1518 cut-off events. For 14351/14697 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9179 event pairs, 42 based on Foata normal form. 327/1832 useless extension candidates. Maximal degree in co-relation 9349. Up to 736 conditions per place. [2023-01-28 07:00:25,892 INFO L137 encePairwiseOnDemand]: 193/199 looper letters, 143 selfloop transitions, 17 changer transitions 57/225 dead transitions. [2023-01-28 07:00:25,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 225 transitions, 3302 flow [2023-01-28 07:00:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:00:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:00:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 853 transitions. [2023-01-28 07:00:25,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47627024008933555 [2023-01-28 07:00:25,894 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 853 transitions. [2023-01-28 07:00:25,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 853 transitions. [2023-01-28 07:00:25,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:00:25,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 853 transitions. [2023-01-28 07:00:25,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,898 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,898 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 1120 flow. Second operand 9 states and 853 transitions. [2023-01-28 07:00:25,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 225 transitions, 3302 flow [2023-01-28 07:00:25,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 225 transitions, 3244 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-01-28 07:00:25,922 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 1026 flow [2023-01-28 07:00:25,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-01-28 07:00:25,922 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2023-01-28 07:00:25,922 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 1026 flow [2023-01-28 07:00:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:00:25,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:00:25,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:00:25,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 07:00:25,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:00:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 617437737, now seen corresponding path program 1 times [2023-01-28 07:00:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:00:25,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873836534] [2023-01-28 07:00:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:00:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:00:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:00:25,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:00:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:00:26,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:00:26,014 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:00:26,014 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 07:00:26,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 07:00:26,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 07:00:26,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 07:00:26,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 07:00:26,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 07:00:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 07:00:26,018 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:00:26,022 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:00:26,022 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:00:26,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:00:26 BasicIcfg [2023-01-28 07:00:26,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:00:26,078 INFO L158 Benchmark]: Toolchain (without parser) took 13139.57ms. Allocated memory was 335.5MB in the beginning and 826.3MB in the end (delta: 490.7MB). Free memory was 293.7MB in the beginning and 719.1MB in the end (delta: -425.4MB). Peak memory consumption was 67.3MB. Max. memory is 16.0GB. [2023-01-28 07:00:26,078 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 335.5MB. Free memory is still 284.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:00:26,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.36ms. Allocated memory is still 335.5MB. Free memory was 293.7MB in the beginning and 270.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:26,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.06ms. Allocated memory is still 335.5MB. Free memory was 270.6MB in the beginning and 267.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:26,078 INFO L158 Benchmark]: Boogie Preprocessor took 45.50ms. Allocated memory is still 335.5MB. Free memory was 267.5MB in the beginning and 265.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:00:26,078 INFO L158 Benchmark]: RCFGBuilder took 590.60ms. Allocated memory is still 335.5MB. Free memory was 265.5MB in the beginning and 227.5MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 07:00:26,079 INFO L158 Benchmark]: TraceAbstraction took 12057.91ms. Allocated memory was 335.5MB in the beginning and 826.3MB in the end (delta: 490.7MB). Free memory was 226.6MB in the beginning and 719.1MB in the end (delta: -492.5MB). Peak memory consumption was 208.9kB. Max. memory is 16.0GB. [2023-01-28 07:00:26,079 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 335.5MB. Free memory is still 284.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 395.36ms. Allocated memory is still 335.5MB. Free memory was 293.7MB in the beginning and 270.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.06ms. Allocated memory is still 335.5MB. Free memory was 270.6MB in the beginning and 267.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.50ms. Allocated memory is still 335.5MB. Free memory was 267.5MB in the beginning and 265.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 590.60ms. Allocated memory is still 335.5MB. Free memory was 265.5MB in the beginning and 227.5MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 12057.91ms. Allocated memory was 335.5MB in the beginning and 826.3MB in the end (delta: 490.7MB). Free memory was 226.6MB in the beginning and 719.1MB in the end (delta: -492.5MB). Peak memory consumption was 208.9kB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4689 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2154, independent: 1998, independent conditional: 0, independent unconditional: 1998, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1045, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2154, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 1045, unknown conditional: 0, unknown unconditional: 1045] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)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=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 819]: 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: 823]: 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: 821]: 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: 11.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 846 IncrementalHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 17 mSDtfsCounter, 846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1362occurred in iteration=8, InterpolantAutomatonStates: 60, 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.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:00:26,101 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...