/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:01:03,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:01:03,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:01:03,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:01:03,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:01:03,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:01:03,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:01:03,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:01:03,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:01:03,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:01:03,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:01:03,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:01:03,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:01:03,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:01:03,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:01:03,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:01:03,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:01:03,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:01:03,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:01:03,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:01:03,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:01:03,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:01:03,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:01:03,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:01:03,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:01:03,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:01:03,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:01:03,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:01:03,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:01:03,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:01:03,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:01:03,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:01:03,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:01:03,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:01:03,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:01:03,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:01:03,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:01:03,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:01:03,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:01:03,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:01:03,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:01:03,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:01:03,240 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:01:03,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:01:03,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:01:03,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:01:03,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:01:03,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:01:03,244 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:01:03,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:01:03,244 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:01:03,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:01:03,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:01:03,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:01:03,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:01:03,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:01:03,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:01:03,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:01:03,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:01:03,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:01:03,248 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:01:03,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:01:03,248 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:01:03,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:01:03,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:01:03,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:01:03,489 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:01:03,489 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:01:03,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:01:04,623 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:01:04,814 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:01:04,815 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:01:04,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e161e1bcf/bb91229160ad4ec090e7d0ac7a572661/FLAGac1cbc1d5 [2023-01-28 07:01:04,846 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e161e1bcf/bb91229160ad4ec090e7d0ac7a572661 [2023-01-28 07:01:04,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:01:04,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:01:04,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:01:04,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:01:04,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:01:04,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:04" (1/1) ... [2023-01-28 07:01:04,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a93f071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:04, skipping insertion in model container [2023-01-28 07:01:04,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:01:04" (1/1) ... [2023-01-28 07:01:04,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:01:04,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:01:05,021 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 07:01:05,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:01:05,190 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:01:05,202 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-01-28 07:01:05,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:01:05,310 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:01:05,310 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:01:05,316 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:01:05,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05 WrapperNode [2023-01-28 07:01:05,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:01:05,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:01:05,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:01:05,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:01:05,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,384 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-01-28 07:01:05,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:01:05,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:01:05,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:01:05,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:01:05,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:01:05,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:01:05,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:01:05,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:01:05,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (1/1) ... [2023-01-28 07:01:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:01:05,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:01:05,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 07:01:05,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 07:01:05,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:01:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:01:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:01:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:01:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:01:05,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:01:05,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:01:05,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:01:05,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:01:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:01:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:01:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:01:05,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:01:05,512 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:01:05,661 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:01:05,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:01:05,946 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:01:06,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:01:06,128 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:01:06,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:01:06 BoogieIcfgContainer [2023-01-28 07:01:06,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:01:06,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:01:06,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:01:06,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:01:06,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:01:04" (1/3) ... [2023-01-28 07:01:06,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b43fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:01:06, skipping insertion in model container [2023-01-28 07:01:06,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:01:05" (2/3) ... [2023-01-28 07:01:06,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b43fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:01:06, skipping insertion in model container [2023-01-28 07:01:06,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:01:06" (3/3) ... [2023-01-28 07:01:06,137 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:01:06,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:01:06,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:01:06,150 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:01:06,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:01:06,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-01-28 07:01:06,293 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-01-28 07:01:06,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:06,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 07:01:06,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-01-28 07:01:06,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-01-28 07:01:06,309 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:01:06,326 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-01-28 07:01:06,328 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-01-28 07:01:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-01-28 07:01:06,355 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-01-28 07:01:06,355 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:06,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 07:01:06,357 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-01-28 07:01:09,939 INFO L134 LiptonReduction]: Checked pairs total: 2470 [2023-01-28 07:01:09,939 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-01-28 07:01:09,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:01:09,955 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;@72d877bb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:01:09,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 07:01:09,958 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 07:01:09,958 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:01:09,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:09,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 07:01:09,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:09,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 401562, now seen corresponding path program 1 times [2023-01-28 07:01:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420633869] [2023-01-28 07:01:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420633869] [2023-01-28 07:01:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420633869] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:10,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:01:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584487179] [2023-01-28 07:01:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:10,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:01:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:01:10,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:01:10,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2023-01-28 07:01:10,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:10,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:10,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2023-01-28 07:01:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:10,481 INFO L130 PetriNetUnfolder]: 111/223 cut-off events. [2023-01-28 07:01:10,481 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 07:01:10,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 223 events. 111/223 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 940 event pairs, 12 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 427. Up to 166 conditions per place. [2023-01-28 07:01:10,484 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-01-28 07:01:10,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 105 flow [2023-01-28 07:01:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:01:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:01:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-01-28 07:01:10,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911242603550296 [2023-01-28 07:01:10,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-01-28 07:01:10,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-01-28 07:01:10,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:10,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-01-28 07:01:10,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:10,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:10,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:10,507 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 249 transitions. [2023-01-28 07:01:10,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 105 flow [2023-01-28 07:01:10,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:10,511 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-01-28 07:01:10,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 07:01:10,515 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-01-28 07:01:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-01-28 07:01:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:10,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:10,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:01:10,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:10,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1520528015, now seen corresponding path program 1 times [2023-01-28 07:01:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866949987] [2023-01-28 07:01:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:11,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866949987] [2023-01-28 07:01:11,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866949987] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:11,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:11,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335386187] [2023-01-28 07:01:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:11,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:11,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:11,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:11,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 169 [2023-01-28 07:01:11,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:11,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:11,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 169 [2023-01-28 07:01:11,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:11,615 INFO L130 PetriNetUnfolder]: 104/190 cut-off events. [2023-01-28 07:01:11,615 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 07:01:11,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 190 events. 104/190 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 646 event pairs, 24 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 404. Up to 157 conditions per place. [2023-01-28 07:01:11,617 INFO L137 encePairwiseOnDemand]: 166/169 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-01-28 07:01:11,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 88 flow [2023-01-28 07:01:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:01:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:01:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2023-01-28 07:01:11,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42998027613412226 [2023-01-28 07:01:11,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2023-01-28 07:01:11,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2023-01-28 07:01:11,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:11,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2023-01-28 07:01:11,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:11,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:11,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:11,622 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 218 transitions. [2023-01-28 07:01:11,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 88 flow [2023-01-28 07:01:11,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:11,623 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2023-01-28 07:01:11,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 07:01:11,624 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-01-28 07:01:11,624 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2023-01-28 07:01:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:11,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:11,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:11,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:01:11,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:11,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -108273127, now seen corresponding path program 1 times [2023-01-28 07:01:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133539138] [2023-01-28 07:01:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133539138] [2023-01-28 07:01:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133539138] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:01:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529674626] [2023-01-28 07:01:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:12,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:01:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:01:12,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:01:12,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 169 [2023-01-28 07:01:12,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:12,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:12,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 169 [2023-01-28 07:01:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:12,578 INFO L130 PetriNetUnfolder]: 157/277 cut-off events. [2023-01-28 07:01:12,578 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-01-28 07:01:12,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 277 events. 157/277 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1038 event pairs, 10 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 610. Up to 168 conditions per place. [2023-01-28 07:01:12,584 INFO L137 encePairwiseOnDemand]: 161/169 looper letters, 28 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2023-01-28 07:01:12,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 38 transitions, 176 flow [2023-01-28 07:01:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:01:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:01:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 360 transitions. [2023-01-28 07:01:12,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260355029585799 [2023-01-28 07:01:12,587 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 360 transitions. [2023-01-28 07:01:12,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 360 transitions. [2023-01-28 07:01:12,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:12,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 360 transitions. [2023-01-28 07:01:12,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:12,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:12,592 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:12,593 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 360 transitions. [2023-01-28 07:01:12,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 38 transitions, 176 flow [2023-01-28 07:01:12,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:12,594 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 108 flow [2023-01-28 07:01:12,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-01-28 07:01:12,596 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-01-28 07:01:12,597 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 108 flow [2023-01-28 07:01:12,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:12,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:12,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:12,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:01:12,598 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:12,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -109155697, now seen corresponding path program 2 times [2023-01-28 07:01:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229652295] [2023-01-28 07:01:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229652295] [2023-01-28 07:01:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229652295] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:13,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015854599] [2023-01-28 07:01:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:13,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:13,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:13,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 169 [2023-01-28 07:01:13,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 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 07:01:13,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:13,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 169 [2023-01-28 07:01:13,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:13,368 INFO L130 PetriNetUnfolder]: 182/330 cut-off events. [2023-01-28 07:01:13,368 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2023-01-28 07:01:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 330 events. 182/330 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1295 event pairs, 28 based on Foata normal form. 20/350 useless extension candidates. Maximal degree in co-relation 1006. Up to 136 conditions per place. [2023-01-28 07:01:13,370 INFO L137 encePairwiseOnDemand]: 165/169 looper letters, 22 selfloop transitions, 3 changer transitions 13/38 dead transitions. [2023-01-28 07:01:13,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 237 flow [2023-01-28 07:01:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 288 transitions. [2023-01-28 07:01:13,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260355029585799 [2023-01-28 07:01:13,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 288 transitions. [2023-01-28 07:01:13,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 288 transitions. [2023-01-28 07:01:13,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:13,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 288 transitions. [2023-01-28 07:01:13,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:13,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:13,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:13,381 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 108 flow. Second operand 4 states and 288 transitions. [2023-01-28 07:01:13,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 237 flow [2023-01-28 07:01:13,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:01:13,384 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 86 flow [2023-01-28 07:01:13,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-01-28 07:01:13,385 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-01-28 07:01:13,385 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 86 flow [2023-01-28 07:01:13,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 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 07:01:13,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:13,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:13,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:01:13,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:13,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1318078625, now seen corresponding path program 1 times [2023-01-28 07:01:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309233539] [2023-01-28 07:01:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309233539] [2023-01-28 07:01:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309233539] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000623439] [2023-01-28 07:01:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:14,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:14,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:14,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 169 [2023-01-28 07:01:14,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:14,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 169 [2023-01-28 07:01:14,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:14,145 INFO L130 PetriNetUnfolder]: 80/157 cut-off events. [2023-01-28 07:01:14,145 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2023-01-28 07:01:14,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 157 events. 80/157 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 467 event pairs, 22 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 519. Up to 130 conditions per place. [2023-01-28 07:01:14,146 INFO L137 encePairwiseOnDemand]: 162/169 looper letters, 23 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2023-01-28 07:01:14,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 200 flow [2023-01-28 07:01:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:01:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:01:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2023-01-28 07:01:14,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2023-01-28 07:01:14,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 377 transitions. [2023-01-28 07:01:14,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 377 transitions. [2023-01-28 07:01:14,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:14,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 377 transitions. [2023-01-28 07:01:14,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,152 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,152 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 86 flow. Second operand 5 states and 377 transitions. [2023-01-28 07:01:14,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 200 flow [2023-01-28 07:01:14,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 176 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-01-28 07:01:14,155 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 112 flow [2023-01-28 07:01:14,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-28 07:01:14,158 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-01-28 07:01:14,158 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 112 flow [2023-01-28 07:01:14,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:14,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:14,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:01:14,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:14,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash -970858713, now seen corresponding path program 2 times [2023-01-28 07:01:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:14,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778053244] [2023-01-28 07:01:14,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:14,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778053244] [2023-01-28 07:01:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778053244] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:01:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079238502] [2023-01-28 07:01:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:14,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 169 [2023-01-28 07:01:14,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:14,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 169 [2023-01-28 07:01:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:14,639 INFO L130 PetriNetUnfolder]: 78/154 cut-off events. [2023-01-28 07:01:14,639 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2023-01-28 07:01:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 154 events. 78/154 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 460 event pairs, 21 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 532. Up to 129 conditions per place. [2023-01-28 07:01:14,641 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 23 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2023-01-28 07:01:14,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 208 flow [2023-01-28 07:01:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:01:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:01:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2023-01-28 07:01:14,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4526627218934911 [2023-01-28 07:01:14,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 306 transitions. [2023-01-28 07:01:14,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions. [2023-01-28 07:01:14,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:14,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions. [2023-01-28 07:01:14,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,645 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,645 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 112 flow. Second operand 4 states and 306 transitions. [2023-01-28 07:01:14,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 208 flow [2023-01-28 07:01:14,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:01:14,647 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 145 flow [2023-01-28 07:01:14,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-01-28 07:01:14,648 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-01-28 07:01:14,648 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 145 flow [2023-01-28 07:01:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:14,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:14,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:14,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:01:14,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:14,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1050357630, now seen corresponding path program 1 times [2023-01-28 07:01:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972219839] [2023-01-28 07:01:14,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972219839] [2023-01-28 07:01:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972219839] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840874138] [2023-01-28 07:01:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:15,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:15,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:15,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 169 [2023-01-28 07:01:15,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:15,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 169 [2023-01-28 07:01:15,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:15,504 INFO L130 PetriNetUnfolder]: 78/161 cut-off events. [2023-01-28 07:01:15,504 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2023-01-28 07:01:15,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 161 events. 78/161 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 506 event pairs, 57 based on Foata normal form. 14/175 useless extension candidates. Maximal degree in co-relation 608. Up to 134 conditions per place. [2023-01-28 07:01:15,505 INFO L137 encePairwiseOnDemand]: 163/169 looper letters, 20 selfloop transitions, 5 changer transitions 7/33 dead transitions. [2023-01-28 07:01:15,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 259 flow [2023-01-28 07:01:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 408 transitions. [2023-01-28 07:01:15,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40236686390532544 [2023-01-28 07:01:15,507 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 408 transitions. [2023-01-28 07:01:15,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 408 transitions. [2023-01-28 07:01:15,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:15,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 408 transitions. [2023-01-28 07:01:15,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,510 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,510 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 145 flow. Second operand 6 states and 408 transitions. [2023-01-28 07:01:15,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 259 flow [2023-01-28 07:01:15,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 230 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-01-28 07:01:15,512 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 143 flow [2023-01-28 07:01:15,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-01-28 07:01:15,513 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-01-28 07:01:15,513 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 143 flow [2023-01-28 07:01:15,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:15,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:15,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:01:15,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:15,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1132719162, now seen corresponding path program 2 times [2023-01-28 07:01:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196349979] [2023-01-28 07:01:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196349979] [2023-01-28 07:01:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196349979] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:15,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:15,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:01:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282749329] [2023-01-28 07:01:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:15,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:01:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:15,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:01:15,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:01:15,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 169 [2023-01-28 07:01:15,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:15,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 169 [2023-01-28 07:01:15,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:15,967 INFO L130 PetriNetUnfolder]: 42/106 cut-off events. [2023-01-28 07:01:15,967 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2023-01-28 07:01:15,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 106 events. 42/106 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 337 event pairs, 4 based on Foata normal form. 14/119 useless extension candidates. Maximal degree in co-relation 406. Up to 47 conditions per place. [2023-01-28 07:01:15,968 INFO L137 encePairwiseOnDemand]: 161/169 looper letters, 21 selfloop transitions, 7 changer transitions 19/50 dead transitions. [2023-01-28 07:01:15,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 372 flow [2023-01-28 07:01:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:01:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:01:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 641 transitions. [2023-01-28 07:01:15,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42143326758711375 [2023-01-28 07:01:15,971 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 641 transitions. [2023-01-28 07:01:15,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 641 transitions. [2023-01-28 07:01:15,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:15,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 641 transitions. [2023-01-28 07:01:15,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.22222222222223) internal successors, (641), 9 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,976 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,976 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 143 flow. Second operand 9 states and 641 transitions. [2023-01-28 07:01:15,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 372 flow [2023-01-28 07:01:15,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 347 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-01-28 07:01:15,979 INFO L231 Difference]: Finished difference. Result has 47 places, 21 transitions, 151 flow [2023-01-28 07:01:15,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=47, PETRI_TRANSITIONS=21} [2023-01-28 07:01:15,979 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2023-01-28 07:01:15,979 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 21 transitions, 151 flow [2023-01-28 07:01:15,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:15,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:15,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:15,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:01:15,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:15,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:15,981 INFO L85 PathProgramCache]: Analyzing trace with hash 133911163, now seen corresponding path program 1 times [2023-01-28 07:01:15,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:15,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248894107] [2023-01-28 07:01:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:16,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:16,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248894107] [2023-01-28 07:01:16,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248894107] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:16,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:01:16,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479498474] [2023-01-28 07:01:16,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:01:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:01:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:01:16,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 169 [2023-01-28 07:01:16,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 21 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:16,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 169 [2023-01-28 07:01:16,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:16,216 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-01-28 07:01:16,216 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2023-01-28 07:01:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 51 events. 17/51 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 5 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 222. Up to 21 conditions per place. [2023-01-28 07:01:16,216 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 18 selfloop transitions, 5 changer transitions 6/32 dead transitions. [2023-01-28 07:01:16,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 275 flow [2023-01-28 07:01:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 448 transitions. [2023-01-28 07:01:16,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4418145956607495 [2023-01-28 07:01:16,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 448 transitions. [2023-01-28 07:01:16,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 448 transitions. [2023-01-28 07:01:16,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:16,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 448 transitions. [2023-01-28 07:01:16,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.66666666666667) internal successors, (448), 6 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 07:01:16,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,222 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,222 INFO L175 Difference]: Start difference. First operand has 47 places, 21 transitions, 151 flow. Second operand 6 states and 448 transitions. [2023-01-28 07:01:16,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 275 flow [2023-01-28 07:01:16,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 212 flow, removed 24 selfloop flow, removed 8 redundant places. [2023-01-28 07:01:16,223 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 126 flow [2023-01-28 07:01:16,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2023-01-28 07:01:16,224 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2023-01-28 07:01:16,224 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 126 flow [2023-01-28 07:01:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:16,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:16,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:16,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:01:16,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:16,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash -950988202, now seen corresponding path program 1 times [2023-01-28 07:01:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656668826] [2023-01-28 07:01:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:01:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:01:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:01:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656668826] [2023-01-28 07:01:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656668826] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:01:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:01:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 07:01:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45254004] [2023-01-28 07:01:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:01:17,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 07:01:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:01:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 07:01:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 07:01:17,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 169 [2023-01-28 07:01:17,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 21 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 68.75) internal successors, (550), 8 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:01:17,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 169 [2023-01-28 07:01:17,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:01:17,197 INFO L130 PetriNetUnfolder]: 15/54 cut-off events. [2023-01-28 07:01:17,197 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2023-01-28 07:01:17,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 54 events. 15/54 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 209. Up to 27 conditions per place. [2023-01-28 07:01:17,198 INFO L137 encePairwiseOnDemand]: 164/169 looper letters, 17 selfloop transitions, 4 changer transitions 12/34 dead transitions. [2023-01-28 07:01:17,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 268 flow [2023-01-28 07:01:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:01:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:01:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 430 transitions. [2023-01-28 07:01:17,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4240631163708087 [2023-01-28 07:01:17,200 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 430 transitions. [2023-01-28 07:01:17,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 430 transitions. [2023-01-28 07:01:17,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:01:17,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 430 transitions. [2023-01-28 07:01:17,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,203 INFO L175 Difference]: Start difference. First operand has 41 places, 21 transitions, 126 flow. Second operand 6 states and 430 transitions. [2023-01-28 07:01:17,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 268 flow [2023-01-28 07:01:17,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 227 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-01-28 07:01:17,205 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 102 flow [2023-01-28 07:01:17,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-01-28 07:01:17,205 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2023-01-28 07:01:17,205 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 102 flow [2023-01-28 07:01:17,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.75) internal successors, (550), 8 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:01:17,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:01:17,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:01:17,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:01:17,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:01:17,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:01:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1424215650, now seen corresponding path program 2 times [2023-01-28 07:01:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:01:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522571755] [2023-01-28 07:01:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:01:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:01:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:01:17,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:01:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:01:17,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:01:17,317 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:01:17,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 07:01:17,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 07:01:17,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 07:01:17,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 07:01:17,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 07:01:17,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:01:17,320 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2023-01-28 07:01:17,325 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:01:17,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:01:17,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:01:17 BasicIcfg [2023-01-28 07:01:17,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:01:17,389 INFO L158 Benchmark]: Toolchain (without parser) took 12535.31ms. Allocated memory was 369.1MB in the beginning and 641.7MB in the end (delta: 272.6MB). Free memory was 328.6MB in the beginning and 351.3MB in the end (delta: -22.8MB). Peak memory consumption was 251.9MB. Max. memory is 16.0GB. [2023-01-28 07:01:17,389 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:01:17,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.08ms. Allocated memory is still 369.1MB. Free memory was 328.2MB in the beginning and 305.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 07:01:17,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.96ms. Allocated memory is still 369.1MB. Free memory was 305.9MB in the beginning and 303.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 07:01:17,390 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 369.1MB. Free memory was 303.1MB in the beginning and 301.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:01:17,390 INFO L158 Benchmark]: RCFGBuilder took 690.66ms. Allocated memory is still 369.1MB. Free memory was 301.4MB in the beginning and 327.1MB in the end (delta: -25.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. [2023-01-28 07:01:17,390 INFO L158 Benchmark]: TraceAbstraction took 11256.59ms. Allocated memory was 369.1MB in the beginning and 641.7MB in the end (delta: 272.6MB). Free memory was 326.6MB in the beginning and 351.3MB in the end (delta: -24.8MB). Peak memory consumption was 247.8MB. Max. memory is 16.0GB. [2023-01-28 07:01:17,391 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 460.08ms. Allocated memory is still 369.1MB. Free memory was 328.2MB in the beginning and 305.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.96ms. Allocated memory is still 369.1MB. Free memory was 305.9MB in the beginning and 303.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 369.1MB. Free memory was 303.1MB in the beginning and 301.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 690.66ms. Allocated memory is still 369.1MB. Free memory was 301.4MB in the beginning and 327.1MB in the end (delta: -25.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. * TraceAbstraction took 11256.59ms. Allocated memory was 369.1MB in the beginning and 641.7MB in the end (delta: 272.6MB). Free memory was 326.6MB in the beginning and 351.3MB in the end (delta: -24.8MB). Peak memory consumption was 247.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 90 PlacesBefore, 24 PlacesAfterwards, 85 TransitionsBefore, 17 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 2470 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1129, independent: 1014, independent conditional: 0, independent unconditional: 1014, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 582, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1129, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 582, unknown conditional: 0, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-2, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=-1, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 13 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:01:17,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...