/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 BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:46:43,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:46:43,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:46:43,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:46:43,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:46:43,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:46:43,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:46:43,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:46:43,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:46:43,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:46:43,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:46:43,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:46:43,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:46:43,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:46:43,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:46:43,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:46:43,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:46:43,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:46:43,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:46:43,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:46:43,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:46:43,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:46:43,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:46:43,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:46:43,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:46:43,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:46:43,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:46:43,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:46:43,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:46:43,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:46:43,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:46:43,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:46:43,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:46:43,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:46:43,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:46:43,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:46:43,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:46:43,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:46:43,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:46:43,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:46:43,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:46:43,532 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 00:46:43,555 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:46:43,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:46:43,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:46:43,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:46:43,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:46:43,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:46:43,556 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:46:43,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:46:43,556 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:46:43,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:46:43,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:46:43,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:43,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:46:43,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:46:43,558 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 -> BEFORE [2023-01-28 00:46:43,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:46:43,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:46:43,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:46:43,762 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:46:43,763 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:46:43,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 00:46:44,669 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:46:44,903 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:46:44,903 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 00:46:44,910 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ea5cb65/62ebaaa0da394f4c84fde305bafc5433/FLAG3c1b97922 [2023-01-28 00:46:44,920 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ea5cb65/62ebaaa0da394f4c84fde305bafc5433 [2023-01-28 00:46:44,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:46:44,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:46:44,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:44,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:46:44,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:46:44,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:44" (1/1) ... [2023-01-28 00:46:44,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90f0a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:44, skipping insertion in model container [2023-01-28 00:46:44,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:46:44" (1/1) ... [2023-01-28 00:46:44,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:46:44,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:46:45,083 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-01-28 00:46:45,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:45,230 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:46:45,240 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-01-28 00:46:45,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:46:45,309 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:45,309 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:46:45,314 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:46:45,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45 WrapperNode [2023-01-28 00:46:45,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:46:45,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:45,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:46:45,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:46:45,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,375 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 00:46:45,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:46:45,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:46:45,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:46:45,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:46:45,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,401 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:46:45,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:46:45,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:46:45,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:46:45,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (1/1) ... [2023-01-28 00:46:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:46:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:46:45,440 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 00:46:45,446 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 00:46:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:46:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:46:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:46:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:46:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:46:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:46:45,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:46:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:46:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:46:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:46:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:46:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:46:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:46:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:46:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:46:45,468 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 00:46:45,570 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:46:45,572 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:46:45,832 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:46:45,927 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:46:45,928 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:46:45,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:45 BoogieIcfgContainer [2023-01-28 00:46:45,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:46:45,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:46:45,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:46:45,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:46:45,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:46:44" (1/3) ... [2023-01-28 00:46:45,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120744f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:45, skipping insertion in model container [2023-01-28 00:46:45,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:46:45" (2/3) ... [2023-01-28 00:46:45,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120744f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:46:45, skipping insertion in model container [2023-01-28 00:46:45,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:46:45" (3/3) ... [2023-01-28 00:46:45,935 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-01-28 00:46:45,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:46:45,947 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:46:45,947 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:46:45,996 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:46:46,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 00:46:46,083 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 00:46:46,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:46,088 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 00:46:46,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 00:46:46,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-28 00:46:46,094 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:46:46,104 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 00:46:46,107 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 00:46:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-28 00:46:46,146 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 00:46:46,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:46,147 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 00:46:46,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-28 00:46:49,378 INFO L134 LiptonReduction]: Checked pairs total: 4735 [2023-01-28 00:46:49,378 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 00:46:49,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:46:49,393 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;@76484047, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:46:49,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:46:49,394 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 00:46:49,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:46:49,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:49,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 00:46:49,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:49,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 469687, now seen corresponding path program 1 times [2023-01-28 00:46:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500788185] [2023-01-28 00:46:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:49,652 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 00:46:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500788185] [2023-01-28 00:46:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500788185] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:49,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:46:49,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735751537] [2023-01-28 00:46:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:49,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:46:49,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:46:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:46:49,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 201 [2023-01-28 00:46:49,686 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.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:49,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:49,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 201 [2023-01-28 00:46:49,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:49,870 INFO L130 PetriNetUnfolder]: 711/1170 cut-off events. [2023-01-28 00:46:49,870 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 00:46:49,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 1170 events. 711/1170 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6125 event pairs, 111 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 2278. Up to 871 conditions per place. [2023-01-28 00:46:49,880 INFO L137 encePairwiseOnDemand]: 198/201 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-01-28 00:46:49,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-01-28 00:46:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:46:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:46:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-01-28 00:46:49,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190713101160862 [2023-01-28 00:46:49,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-01-28 00:46:49,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-01-28 00:46:49,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:49,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-01-28 00:46:49,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 00:46:49,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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 00:46:49,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states 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 00:46:49,909 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 313 transitions. [2023-01-28 00:46:49,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-01-28 00:46:49,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:46:49,912 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-28 00:46:49,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, 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 00:46:49,916 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-28 00:46:49,916 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-28 00:46:49,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:49,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:49,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:49,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:46:49,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:49,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -205373446, now seen corresponding path program 1 times [2023-01-28 00:46:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723583401] [2023-01-28 00:46:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:49,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:50,704 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 00:46:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723583401] [2023-01-28 00:46:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723583401] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:50,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:50,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487774724] [2023-01-28 00:46:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:50,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:50,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:50,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 00:46:50,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 00:46:50,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:50,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 00:46:50,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:50,926 INFO L130 PetriNetUnfolder]: 1042/1647 cut-off events. [2023-01-28 00:46:50,926 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2023-01-28 00:46:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1647 events. 1042/1647 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7978 event pairs, 166 based on Foata normal form. 30/1677 useless extension candidates. Maximal degree in co-relation 3346. Up to 1323 conditions per place. [2023-01-28 00:46:50,934 INFO L137 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-28 00:46:50,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 210 flow [2023-01-28 00:46:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 373 transitions. [2023-01-28 00:46:50,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639303482587065 [2023-01-28 00:46:50,936 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 373 transitions. [2023-01-28 00:46:50,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 373 transitions. [2023-01-28 00:46:50,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:50,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 373 transitions. [2023-01-28 00:46:50,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states 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 00:46:50,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:50,940 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:50,941 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 373 transitions. [2023-01-28 00:46:50,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 210 flow [2023-01-28 00:46:50,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:50,943 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2023-01-28 00:46:50,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-01-28 00:46:50,944 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-28 00:46:50,944 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2023-01-28 00:46:50,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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 00:46:50,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:50,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:50,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:46:50,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:50,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2071610583, now seen corresponding path program 1 times [2023-01-28 00:46:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447995493] [2023-01-28 00:46:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:51,480 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 00:46:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447995493] [2023-01-28 00:46:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447995493] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:51,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:51,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759850742] [2023-01-28 00:46:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:51,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 00:46:51,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 00:46:51,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:51,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 00:46:51,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:51,659 INFO L130 PetriNetUnfolder]: 992/1504 cut-off events. [2023-01-28 00:46:51,659 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2023-01-28 00:46:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 1504 events. 992/1504 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6494 event pairs, 181 based on Foata normal form. 18/1520 useless extension candidates. Maximal degree in co-relation 4173. Up to 1076 conditions per place. [2023-01-28 00:46:51,668 INFO L137 encePairwiseOnDemand]: 192/201 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-01-28 00:46:51,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 273 flow [2023-01-28 00:46:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2023-01-28 00:46:51,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-01-28 00:46:51,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 363 transitions. [2023-01-28 00:46:51,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 363 transitions. [2023-01-28 00:46:51,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:51,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 363 transitions. [2023-01-28 00:46:51,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 00:46:51,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:51,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:51,672 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 4 states and 363 transitions. [2023-01-28 00:46:51,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 273 flow [2023-01-28 00:46:51,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:46:51,675 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 196 flow [2023-01-28 00:46:51,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=111, 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=196, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-01-28 00:46:51,677 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-28 00:46:51,679 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 196 flow [2023-01-28 00:46:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 00:46:51,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:51,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:51,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:46:51,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:51,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1204847949, now seen corresponding path program 1 times [2023-01-28 00:46:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:51,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036896551] [2023-01-28 00:46:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:52,432 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 00:46:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036896551] [2023-01-28 00:46:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036896551] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802985330] [2023-01-28 00:46:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:52,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 00:46:52,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 00:46:52,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:52,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 00:46:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:52,719 INFO L130 PetriNetUnfolder]: 1098/1666 cut-off events. [2023-01-28 00:46:52,719 INFO L131 PetriNetUnfolder]: For 1730/1730 co-relation queries the response was YES. [2023-01-28 00:46:52,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 1666 events. 1098/1666 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7387 event pairs, 293 based on Foata normal form. 12/1677 useless extension candidates. Maximal degree in co-relation 5319. Up to 1280 conditions per place. [2023-01-28 00:46:52,731 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 41 selfloop transitions, 23 changer transitions 0/65 dead transitions. [2023-01-28 00:46:52,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 446 flow [2023-01-28 00:46:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-01-28 00:46:52,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651741293532338 [2023-01-28 00:46:52,756 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-01-28 00:46:52,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-01-28 00:46:52,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:52,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-01-28 00:46:52,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states 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 00:46:52,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:52,759 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:52,759 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 196 flow. Second operand 4 states and 374 transitions. [2023-01-28 00:46:52,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 446 flow [2023-01-28 00:46:52,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:46:52,770 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 375 flow [2023-01-28 00:46:52,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2023-01-28 00:46:52,771 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-01-28 00:46:52,771 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 375 flow [2023-01-28 00:46:52,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 00:46:52,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:52,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:52,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:46:52,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:52,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2046726141, now seen corresponding path program 1 times [2023-01-28 00:46:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622989265] [2023-01-28 00:46:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:53,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622989265] [2023-01-28 00:46:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622989265] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:53,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507803867] [2023-01-28 00:46:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:53,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:53,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:53,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 00:46:53,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 00:46:53,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:53,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 00:46:53,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:53,569 INFO L130 PetriNetUnfolder]: 1610/2375 cut-off events. [2023-01-28 00:46:53,569 INFO L131 PetriNetUnfolder]: For 5678/5678 co-relation queries the response was YES. [2023-01-28 00:46:53,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 2375 events. 1610/2375 cut-off events. For 5678/5678 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10749 event pairs, 163 based on Foata normal form. 22/2397 useless extension candidates. Maximal degree in co-relation 9327. Up to 1262 conditions per place. [2023-01-28 00:46:53,583 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 65 selfloop transitions, 51 changer transitions 0/116 dead transitions. [2023-01-28 00:46:53,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 116 transitions, 1051 flow [2023-01-28 00:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2023-01-28 00:46:53,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45870646766169154 [2023-01-28 00:46:53,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2023-01-28 00:46:53,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2023-01-28 00:46:53,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:53,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2023-01-28 00:46:53,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 00:46:53,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:53,588 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:53,588 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 375 flow. Second operand 5 states and 461 transitions. [2023-01-28 00:46:53,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 116 transitions, 1051 flow [2023-01-28 00:46:53,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 116 transitions, 1051 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:46:53,602 INFO L231 Difference]: Finished difference. Result has 52 places, 81 transitions, 921 flow [2023-01-28 00:46:53,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=921, PETRI_PLACES=52, PETRI_TRANSITIONS=81} [2023-01-28 00:46:53,604 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-01-28 00:46:53,604 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 81 transitions, 921 flow [2023-01-28 00:46:53,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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 00:46:53,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:53,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:53,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:46:53,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:53,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash -500207653, now seen corresponding path program 2 times [2023-01-28 00:46:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083115431] [2023-01-28 00:46:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:54,032 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 00:46:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083115431] [2023-01-28 00:46:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083115431] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384186996] [2023-01-28 00:46:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:54,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:54,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 00:46:54,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 81 transitions, 921 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 00:46:54,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:54,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 00:46:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:54,353 INFO L130 PetriNetUnfolder]: 1811/2770 cut-off events. [2023-01-28 00:46:54,354 INFO L131 PetriNetUnfolder]: For 11617/11746 co-relation queries the response was YES. [2023-01-28 00:46:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13616 conditions, 2770 events. 1811/2770 cut-off events. For 11617/11746 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14006 event pairs, 344 based on Foata normal form. 135/2905 useless extension candidates. Maximal degree in co-relation 13589. Up to 1441 conditions per place. [2023-01-28 00:46:54,370 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 77 selfloop transitions, 16 changer transitions 17/112 dead transitions. [2023-01-28 00:46:54,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 1347 flow [2023-01-28 00:46:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-01-28 00:46:54,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458955223880597 [2023-01-28 00:46:54,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-01-28 00:46:54,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-01-28 00:46:54,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:54,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-01-28 00:46:54,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:54,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:54,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:54,375 INFO L175 Difference]: Start difference. First operand has 52 places, 81 transitions, 921 flow. Second operand 4 states and 369 transitions. [2023-01-28 00:46:54,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 1347 flow [2023-01-28 00:46:54,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 1347 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:46:54,402 INFO L231 Difference]: Finished difference. Result has 57 places, 73 transitions, 840 flow [2023-01-28 00:46:54,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=840, PETRI_PLACES=57, PETRI_TRANSITIONS=73} [2023-01-28 00:46:54,403 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-01-28 00:46:54,404 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 73 transitions, 840 flow [2023-01-28 00:46:54,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 00:46:54,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:54,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:54,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:46:54,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:54,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1998069440, now seen corresponding path program 1 times [2023-01-28 00:46:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809961811] [2023-01-28 00:46:54,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:54,976 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 00:46:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809961811] [2023-01-28 00:46:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809961811] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376413177] [2023-01-28 00:46:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:54,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:46:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:46:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:46:54,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 00:46:54,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 73 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 00:46:54,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:54,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 00:46:54,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:55,560 INFO L130 PetriNetUnfolder]: 2306/3476 cut-off events. [2023-01-28 00:46:55,560 INFO L131 PetriNetUnfolder]: For 17415/17415 co-relation queries the response was YES. [2023-01-28 00:46:55,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 3476 events. 2306/3476 cut-off events. For 17415/17415 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17546 event pairs, 292 based on Foata normal form. 36/3512 useless extension candidates. Maximal degree in co-relation 17095. Up to 1748 conditions per place. [2023-01-28 00:46:55,589 INFO L137 encePairwiseOnDemand]: 190/201 looper letters, 98 selfloop transitions, 89 changer transitions 8/195 dead transitions. [2023-01-28 00:46:55,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 195 transitions, 2376 flow [2023-01-28 00:46:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:46:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:46:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 819 transitions. [2023-01-28 00:46:55,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527363184079602 [2023-01-28 00:46:55,591 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 819 transitions. [2023-01-28 00:46:55,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 819 transitions. [2023-01-28 00:46:55,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:55,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 819 transitions. [2023-01-28 00:46:55,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.0) internal successors, (819), 9 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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 00:46:55,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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 00:46:55,595 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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 00:46:55,595 INFO L175 Difference]: Start difference. First operand has 57 places, 73 transitions, 840 flow. Second operand 9 states and 819 transitions. [2023-01-28 00:46:55,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 195 transitions, 2376 flow [2023-01-28 00:46:55,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 195 transitions, 2303 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:55,634 INFO L231 Difference]: Finished difference. Result has 70 places, 132 transitions, 1844 flow [2023-01-28 00:46:55,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1844, PETRI_PLACES=70, PETRI_TRANSITIONS=132} [2023-01-28 00:46:55,635 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2023-01-28 00:46:55,635 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 132 transitions, 1844 flow [2023-01-28 00:46:55,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 00:46:55,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:55,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:55,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:46:55,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:55,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1112376283, now seen corresponding path program 1 times [2023-01-28 00:46:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772858783] [2023-01-28 00:46:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:56,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 00:46:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772858783] [2023-01-28 00:46:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772858783] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:56,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:56,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968187199] [2023-01-28 00:46:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:56,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:56,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 201 [2023-01-28 00:46:56,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 132 transitions, 1844 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 00:46:56,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:56,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 201 [2023-01-28 00:46:56,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:56,561 INFO L130 PetriNetUnfolder]: 2656/4068 cut-off events. [2023-01-28 00:46:56,561 INFO L131 PetriNetUnfolder]: For 31010/31010 co-relation queries the response was YES. [2023-01-28 00:46:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22870 conditions, 4068 events. 2656/4068 cut-off events. For 31010/31010 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 21488 event pairs, 488 based on Foata normal form. 80/4148 useless extension candidates. Maximal degree in co-relation 22832. Up to 1700 conditions per place. [2023-01-28 00:46:56,577 INFO L137 encePairwiseOnDemand]: 193/201 looper letters, 58 selfloop transitions, 9 changer transitions 98/165 dead transitions. [2023-01-28 00:46:56,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 165 transitions, 2446 flow [2023-01-28 00:46:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-01-28 00:46:56,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445771144278607 [2023-01-28 00:46:56,579 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-01-28 00:46:56,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-01-28 00:46:56,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:56,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-01-28 00:46:56,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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 00:46:56,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:56,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:56,581 INFO L175 Difference]: Start difference. First operand has 70 places, 132 transitions, 1844 flow. Second operand 5 states and 448 transitions. [2023-01-28 00:46:56,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 165 transitions, 2446 flow [2023-01-28 00:46:56,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 165 transitions, 2404 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 00:46:56,634 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 610 flow [2023-01-28 00:46:56,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2023-01-28 00:46:56,635 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2023-01-28 00:46:56,636 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 610 flow [2023-01-28 00:46:56,636 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 00:46:56,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:56,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:56,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:46:56,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:56,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash -993376159, now seen corresponding path program 1 times [2023-01-28 00:46:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:56,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397470784] [2023-01-28 00:46:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397470784] [2023-01-28 00:46:57,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397470784] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:57,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:46:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534153932] [2023-01-28 00:46:57,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:57,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:57,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-01-28 00:46:57,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:57,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:57,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-01-28 00:46:57,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:57,302 INFO L130 PetriNetUnfolder]: 945/1531 cut-off events. [2023-01-28 00:46:57,302 INFO L131 PetriNetUnfolder]: For 12936/12969 co-relation queries the response was YES. [2023-01-28 00:46:57,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8705 conditions, 1531 events. 945/1531 cut-off events. For 12936/12969 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7203 event pairs, 335 based on Foata normal form. 36/1562 useless extension candidates. Maximal degree in co-relation 8664. Up to 1290 conditions per place. [2023-01-28 00:46:57,311 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 53 selfloop transitions, 12 changer transitions 2/73 dead transitions. [2023-01-28 00:46:57,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 936 flow [2023-01-28 00:46:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-01-28 00:46:57,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975124378109453 [2023-01-28 00:46:57,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-01-28 00:46:57,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-01-28 00:46:57,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:57,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-01-28 00:46:57,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:57,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:57,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:57,317 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 610 flow. Second operand 4 states and 400 transitions. [2023-01-28 00:46:57,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 936 flow [2023-01-28 00:46:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 772 flow, removed 34 selfloop flow, removed 17 redundant places. [2023-01-28 00:46:57,336 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 568 flow [2023-01-28 00:46:57,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=568, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-01-28 00:46:57,337 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-01-28 00:46:57,337 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 568 flow [2023-01-28 00:46:57,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:46:57,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:57,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:57,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:46:57,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:57,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1577164360, now seen corresponding path program 1 times [2023-01-28 00:46:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770202411] [2023-01-28 00:46:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:57,609 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 00:46:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770202411] [2023-01-28 00:46:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770202411] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213507149] [2023-01-28 00:46:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:57,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:57,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-01-28 00:46:57,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 568 flow. Second operand has 5 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 00:46:57,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:57,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-01-28 00:46:57,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:57,789 INFO L130 PetriNetUnfolder]: 886/1453 cut-off events. [2023-01-28 00:46:57,789 INFO L131 PetriNetUnfolder]: For 7089/7128 co-relation queries the response was YES. [2023-01-28 00:46:57,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 1453 events. 886/1453 cut-off events. For 7089/7128 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6821 event pairs, 391 based on Foata normal form. 48/1499 useless extension candidates. Maximal degree in co-relation 7371. Up to 1255 conditions per place. [2023-01-28 00:46:57,796 INFO L137 encePairwiseOnDemand]: 197/201 looper letters, 58 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-01-28 00:46:57,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 823 flow [2023-01-28 00:46:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2023-01-28 00:46:57,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900497512437811 [2023-01-28 00:46:57,798 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 394 transitions. [2023-01-28 00:46:57,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 394 transitions. [2023-01-28 00:46:57,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:57,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 394 transitions. [2023-01-28 00:46:57,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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 00:46:57,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:57,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:57,801 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 568 flow. Second operand 4 states and 394 transitions. [2023-01-28 00:46:57,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 823 flow [2023-01-28 00:46:57,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 807 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:57,809 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 571 flow [2023-01-28 00:46:57,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=571, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-01-28 00:46:57,810 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2023-01-28 00:46:57,811 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 571 flow [2023-01-28 00:46:57,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 00:46:57,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:57,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:57,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:46:57,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:57,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 249893119, now seen corresponding path program 1 times [2023-01-28 00:46:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971257474] [2023-01-28 00:46:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:58,347 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 00:46:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971257474] [2023-01-28 00:46:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971257474] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455827460] [2023-01-28 00:46:58,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:46:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:46:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:46:58,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 201 [2023-01-28 00:46:58,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 00:46:58,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:58,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 201 [2023-01-28 00:46:58,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:58,575 INFO L130 PetriNetUnfolder]: 872/1429 cut-off events. [2023-01-28 00:46:58,575 INFO L131 PetriNetUnfolder]: For 7200/7239 co-relation queries the response was YES. [2023-01-28 00:46:58,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 1429 events. 872/1429 cut-off events. For 7200/7239 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6672 event pairs, 257 based on Foata normal form. 43/1470 useless extension candidates. Maximal degree in co-relation 7299. Up to 1111 conditions per place. [2023-01-28 00:46:58,582 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 55 selfloop transitions, 12 changer transitions 1/74 dead transitions. [2023-01-28 00:46:58,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 834 flow [2023-01-28 00:46:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:46:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:46:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-01-28 00:46:58,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47761194029850745 [2023-01-28 00:46:58,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-01-28 00:46:58,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-01-28 00:46:58,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:58,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-01-28 00:46:58,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 00:46:58,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:58,586 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states 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 00:46:58,586 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 571 flow. Second operand 4 states and 384 transitions. [2023-01-28 00:46:58,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 834 flow [2023-01-28 00:46:58,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 821 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:58,594 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 618 flow [2023-01-28 00:46:58,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=618, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-01-28 00:46:58,594 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2023-01-28 00:46:58,595 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 618 flow [2023-01-28 00:46:58,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 00:46:58,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:58,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:58,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:46:58,595 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:58,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 251251105, now seen corresponding path program 1 times [2023-01-28 00:46:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:58,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804043659] [2023-01-28 00:46:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:58,941 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 00:46:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804043659] [2023-01-28 00:46:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804043659] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:58,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365835256] [2023-01-28 00:46:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:58,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:46:58,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:58,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:46:58,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:46:58,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-01-28 00:46:58,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 00:46:58,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:58,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-01-28 00:46:58,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:59,190 INFO L130 PetriNetUnfolder]: 935/1545 cut-off events. [2023-01-28 00:46:59,190 INFO L131 PetriNetUnfolder]: For 9791/9830 co-relation queries the response was YES. [2023-01-28 00:46:59,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8321 conditions, 1545 events. 935/1545 cut-off events. For 9791/9830 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7511 event pairs, 322 based on Foata normal form. 57/1594 useless extension candidates. Maximal degree in co-relation 8289. Up to 1151 conditions per place. [2023-01-28 00:46:59,197 INFO L137 encePairwiseOnDemand]: 194/201 looper letters, 61 selfloop transitions, 15 changer transitions 3/85 dead transitions. [2023-01-28 00:46:59,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 1014 flow [2023-01-28 00:46:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:46:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:46:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 574 transitions. [2023-01-28 00:46:59,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759535655058043 [2023-01-28 00:46:59,199 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 574 transitions. [2023-01-28 00:46:59,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 574 transitions. [2023-01-28 00:46:59,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:59,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 574 transitions. [2023-01-28 00:46:59,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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 00:46:59,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:46:59,202 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:46:59,202 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 618 flow. Second operand 6 states and 574 transitions. [2023-01-28 00:46:59,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 1014 flow [2023-01-28 00:46:59,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 998 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:46:59,214 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 724 flow [2023-01-28 00:46:59,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-01-28 00:46:59,214 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2023-01-28 00:46:59,214 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 724 flow [2023-01-28 00:46:59,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 00:46:59,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:59,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:59,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:46:59,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:59,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1792423090, now seen corresponding path program 1 times [2023-01-28 00:46:59,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425539317] [2023-01-28 00:46:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:59,356 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 00:46:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425539317] [2023-01-28 00:46:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425539317] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:46:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543104786] [2023-01-28 00:46:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:59,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:46:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:46:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:46:59,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 00:46:59,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 724 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 00:46:59,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:59,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 00:46:59,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:59,520 INFO L130 PetriNetUnfolder]: 643/1157 cut-off events. [2023-01-28 00:46:59,520 INFO L131 PetriNetUnfolder]: For 12085/12279 co-relation queries the response was YES. [2023-01-28 00:46:59,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 1157 events. 643/1157 cut-off events. For 12085/12279 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6171 event pairs, 95 based on Foata normal form. 247/1396 useless extension candidates. Maximal degree in co-relation 6488. Up to 657 conditions per place. [2023-01-28 00:46:59,525 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 66 selfloop transitions, 6 changer transitions 51/131 dead transitions. [2023-01-28 00:46:59,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 1856 flow [2023-01-28 00:46:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:46:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:46:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-28 00:46:59,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-01-28 00:46:59,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-28 00:46:59,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-28 00:46:59,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:59,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-28 00:46:59,528 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 00:46:59,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:59,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:46:59,530 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 724 flow. Second operand 5 states and 487 transitions. [2023-01-28 00:46:59,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 1856 flow [2023-01-28 00:46:59,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 1767 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-01-28 00:46:59,538 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 624 flow [2023-01-28 00:46:59,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=624, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-01-28 00:46:59,538 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2023-01-28 00:46:59,539 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 624 flow [2023-01-28 00:46:59,539 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 00:46:59,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:59,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:46:59,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:46:59,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:59,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1767515392, now seen corresponding path program 1 times [2023-01-28 00:46:59,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:59,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628431195] [2023-01-28 00:46:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:46:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:46:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:46:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628431195] [2023-01-28 00:46:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628431195] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:46:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:46:59,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:46:59,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375776711] [2023-01-28 00:46:59,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:46:59,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:46:59,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:46:59,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:46:59,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:46:59,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 00:46:59,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 624 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 00:46:59,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:46:59,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 00:46:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:46:59,861 INFO L130 PetriNetUnfolder]: 448/856 cut-off events. [2023-01-28 00:46:59,862 INFO L131 PetriNetUnfolder]: For 9002/9116 co-relation queries the response was YES. [2023-01-28 00:46:59,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 856 events. 448/856 cut-off events. For 9002/9116 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4469 event pairs, 40 based on Foata normal form. 164/1012 useless extension candidates. Maximal degree in co-relation 5180. Up to 365 conditions per place. [2023-01-28 00:46:59,865 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 70 selfloop transitions, 10 changer transitions 63/151 dead transitions. [2023-01-28 00:46:59,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 2069 flow [2023-01-28 00:46:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:46:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:46:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-28 00:46:59,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48187633262260127 [2023-01-28 00:46:59,867 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-28 00:46:59,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-28 00:46:59,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:46:59,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-28 00:46:59,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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 00:46:59,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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 00:46:59,870 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states 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 00:46:59,871 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 624 flow. Second operand 7 states and 678 transitions. [2023-01-28 00:46:59,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 2069 flow [2023-01-28 00:46:59,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 2021 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-01-28 00:46:59,879 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 628 flow [2023-01-28 00:46:59,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2023-01-28 00:46:59,879 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-01-28 00:46:59,879 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 628 flow [2023-01-28 00:46:59,880 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 00:46:59,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:46:59,880 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 00:46:59,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:46:59,880 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:46:59,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:46:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1311539303, now seen corresponding path program 1 times [2023-01-28 00:46:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:46:59,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143580566] [2023-01-28 00:46:59,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:46:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:46:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:00,046 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 00:47:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:00,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143580566] [2023-01-28 00:47:00,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143580566] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:00,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:00,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:47:00,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242468080] [2023-01-28 00:47:00,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:00,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:47:00,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:00,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:47:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:47:00,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 201 [2023-01-28 00:47:00,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 628 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 00:47:00,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:00,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 201 [2023-01-28 00:47:00,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:00,202 INFO L130 PetriNetUnfolder]: 362/698 cut-off events. [2023-01-28 00:47:00,203 INFO L131 PetriNetUnfolder]: For 7123/7204 co-relation queries the response was YES. [2023-01-28 00:47:00,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 698 events. 362/698 cut-off events. For 7123/7204 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3596 event pairs, 37 based on Foata normal form. 86/777 useless extension candidates. Maximal degree in co-relation 4485. Up to 288 conditions per place. [2023-01-28 00:47:00,205 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 43 selfloop transitions, 10 changer transitions 82/141 dead transitions. [2023-01-28 00:47:00,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 1930 flow [2023-01-28 00:47:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:47:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:47:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 850 transitions. [2023-01-28 00:47:00,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987285793255945 [2023-01-28 00:47:00,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 850 transitions. [2023-01-28 00:47:00,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 850 transitions. [2023-01-28 00:47:00,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:00,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 850 transitions. [2023-01-28 00:47:00,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.44444444444444) internal successors, (850), 9 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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 00:47:00,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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 00:47:00,212 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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 00:47:00,212 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 628 flow. Second operand 9 states and 850 transitions. [2023-01-28 00:47:00,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 1930 flow [2023-01-28 00:47:00,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 141 transitions, 1832 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-01-28 00:47:00,222 INFO L231 Difference]: Finished difference. Result has 81 places, 39 transitions, 395 flow [2023-01-28 00:47:00,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=81, PETRI_TRANSITIONS=39} [2023-01-28 00:47:00,223 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2023-01-28 00:47:00,223 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 39 transitions, 395 flow [2023-01-28 00:47:00,224 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 00:47:00,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:00,224 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 00:47:00,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:47:00,224 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:00,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1201597487, now seen corresponding path program 1 times [2023-01-28 00:47:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:00,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409462561] [2023-01-28 00:47:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:00,879 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 00:47:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409462561] [2023-01-28 00:47:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409462561] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:47:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339380260] [2023-01-28 00:47:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:00,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:47:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:47:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:47:00,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2023-01-28 00:47:00,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 39 transitions, 395 flow. Second operand has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 00:47:00,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:00,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2023-01-28 00:47:00,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:01,013 INFO L130 PetriNetUnfolder]: 121/248 cut-off events. [2023-01-28 00:47:01,014 INFO L131 PetriNetUnfolder]: For 1610/1610 co-relation queries the response was YES. [2023-01-28 00:47:01,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 248 events. 121/248 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 793 event pairs, 18 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 1475. Up to 166 conditions per place. [2023-01-28 00:47:01,015 INFO L137 encePairwiseOnDemand]: 195/201 looper letters, 42 selfloop transitions, 16 changer transitions 6/67 dead transitions. [2023-01-28 00:47:01,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 772 flow [2023-01-28 00:47:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:47:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:47:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-01-28 00:47:01,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44859038142620233 [2023-01-28 00:47:01,018 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-01-28 00:47:01,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-01-28 00:47:01,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:01,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-01-28 00:47:01,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 00:47:01,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:47:01,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:47:01,022 INFO L175 Difference]: Start difference. First operand has 81 places, 39 transitions, 395 flow. Second operand 6 states and 541 transitions. [2023-01-28 00:47:01,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 772 flow [2023-01-28 00:47:01,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 545 flow, removed 72 selfloop flow, removed 22 redundant places. [2023-01-28 00:47:01,026 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 350 flow [2023-01-28 00:47:01,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-01-28 00:47:01,026 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2023-01-28 00:47:01,026 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 350 flow [2023-01-28 00:47:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.375) internal successors, (683), 8 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 00:47:01,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:01,026 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 00:47:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:47:01,027 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:01,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1423510613, now seen corresponding path program 2 times [2023-01-28 00:47:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:01,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033965082] [2023-01-28 00:47:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:47:02,068 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 00:47:02,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:47:02,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033965082] [2023-01-28 00:47:02,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033965082] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:47:02,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:47:02,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:47:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740894198] [2023-01-28 00:47:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:47:02,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:47:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:47:02,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:47:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:47:02,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-01-28 00:47:02,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 350 flow. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 00:47:02,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:47:02,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-01-28 00:47:02,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:47:02,253 INFO L130 PetriNetUnfolder]: 121/262 cut-off events. [2023-01-28 00:47:02,253 INFO L131 PetriNetUnfolder]: For 1226/1226 co-relation queries the response was YES. [2023-01-28 00:47:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 262 events. 121/262 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 894 event pairs, 20 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 1258. Up to 77 conditions per place. [2023-01-28 00:47:02,255 INFO L137 encePairwiseOnDemand]: 196/201 looper letters, 35 selfloop transitions, 4 changer transitions 31/72 dead transitions. [2023-01-28 00:47:02,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 637 flow [2023-01-28 00:47:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:47:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:47:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 530 transitions. [2023-01-28 00:47:02,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.439469320066335 [2023-01-28 00:47:02,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 530 transitions. [2023-01-28 00:47:02,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 530 transitions. [2023-01-28 00:47:02,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:47:02,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 530 transitions. [2023-01-28 00:47:02,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 00:47:02,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:47:02,259 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states 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 00:47:02,259 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 350 flow. Second operand 6 states and 530 transitions. [2023-01-28 00:47:02,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 637 flow [2023-01-28 00:47:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 596 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-01-28 00:47:02,262 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 252 flow [2023-01-28 00:47:02,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-01-28 00:47:02,262 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-01-28 00:47:02,262 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 252 flow [2023-01-28 00:47:02,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 00:47:02,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:47:02,263 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 00:47:02,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 00:47:02,263 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:47:02,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:47:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 746795885, now seen corresponding path program 3 times [2023-01-28 00:47:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:47:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718123271] [2023-01-28 00:47:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:47:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:47:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:47:02,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:47:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:47:02,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:47:02,355 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:47:02,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:47:02,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:47:02,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:47:02,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:47:02,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:47:02,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:47:02,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 00:47:02,358 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:47:02,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:47:02,363 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:47:02,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:47:02 BasicIcfg [2023-01-28 00:47:02,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:47:02,422 INFO L158 Benchmark]: Toolchain (without parser) took 17498.93ms. Allocated memory was 375.4MB in the beginning and 935.3MB in the end (delta: 559.9MB). Free memory was 330.8MB in the beginning and 497.1MB in the end (delta: -166.3MB). Peak memory consumption was 395.7MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,422 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 375.4MB. Free memory is still 322.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:47:02,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.93ms. Allocated memory is still 375.4MB. Free memory was 330.8MB in the beginning and 307.9MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.06ms. Allocated memory is still 375.4MB. Free memory was 307.9MB in the beginning and 305.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,423 INFO L158 Benchmark]: Boogie Preprocessor took 41.71ms. Allocated memory is still 375.4MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,423 INFO L158 Benchmark]: RCFGBuilder took 511.50ms. Allocated memory is still 375.4MB. Free memory was 303.0MB in the beginning and 265.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,423 INFO L158 Benchmark]: TraceAbstraction took 16490.72ms. Allocated memory was 375.4MB in the beginning and 935.3MB in the end (delta: 559.9MB). Free memory was 264.8MB in the beginning and 497.1MB in the end (delta: -232.3MB). Peak memory consumption was 328.6MB. Max. memory is 16.0GB. [2023-01-28 00:47:02,424 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.36ms. Allocated memory is still 375.4MB. Free memory is still 322.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 390.93ms. Allocated memory is still 375.4MB. Free memory was 330.8MB in the beginning and 307.9MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.06ms. Allocated memory is still 375.4MB. Free memory was 307.9MB in the beginning and 305.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.71ms. Allocated memory is still 375.4MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 511.50ms. Allocated memory is still 375.4MB. Free memory was 303.0MB in the beginning and 265.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 16490.72ms. Allocated memory was 375.4MB in the beginning and 935.3MB in the end (delta: 559.9MB). Free memory was 264.8MB in the beginning and 497.1MB in the end (delta: -232.3MB). Peak memory consumption was 328.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4735 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2327, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1065, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2327, independent: 1147, independent conditional: 0, independent unconditional: 1147, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1065, unknown conditional: 0, unknown unconditional: 1065] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 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. - 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. - 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: 16.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 33 mSDtfsCounter, 1381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1844occurred in iteration=7, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 3691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 00:47:02,444 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...