/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/mix028_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:53:57,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:53:57,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:53:57,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:53:57,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:53:57,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:53:57,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:53:57,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:53:57,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:53:57,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:53:57,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:53:57,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:53:57,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:53:57,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:53:57,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:53:57,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:53:57,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:53:57,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:53:57,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:53:57,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:53:57,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:53:57,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:53:57,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:53:57,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:53:57,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:53:57,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:53:57,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:53:57,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:53:57,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:53:57,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:53:57,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:53:57,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:53:57,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:53:57,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:53:57,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:53:57,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:53:57,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:53:57,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:53:57,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:53:57,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:53:57,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:53:57,238 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 06:53:57,261 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:53:57,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:53:57,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:53:57,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:53:57,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:53:57,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:53:57,263 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:53:57,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:53:57,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:53:57,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:53:57,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:53:57,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:53:57,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:53:57,265 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 06:53:57,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:53:57,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:53:57,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:53:57,457 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:53:57,458 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:53:57,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2023-01-28 06:53:58,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:53:58,514 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:53:58,514 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2023-01-28 06:53:58,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf60a8ef/49031e8b99214407ba73ffc31173552d/FLAG3b23b8ad2 [2023-01-28 06:53:58,531 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf60a8ef/49031e8b99214407ba73ffc31173552d [2023-01-28 06:53:58,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:53:58,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:53:58,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:53:58,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:53:58,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:53:58,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:58,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c869112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58, skipping insertion in model container [2023-01-28 06:53:58,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:58,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:53:58,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:53:58,720 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-28 06:53:58,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:53:58,892 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:53:58,901 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/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2023-01-28 06:53:58,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:53:58,972 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:53:58,973 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:53:58,977 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:53:58,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58 WrapperNode [2023-01-28 06:53:58,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:53:58,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:53:58,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:53:58,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:53:58,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,043 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-01-28 06:53:59,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:53:59,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:53:59,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:53:59,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:53:59,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,060 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:53:59,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:53:59,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:53:59,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:53:59,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (1/1) ... [2023-01-28 06:53:59,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:53:59,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:53:59,089 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 06:53:59,095 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 06:53:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:53:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:53:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:53:59,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:53:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:53:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:53:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:53:59,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:53:59,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:53:59,118 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 06:53:59,252 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:53:59,253 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:53:59,436 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:53:59,540 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:53:59,540 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:53:59,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:53:59 BoogieIcfgContainer [2023-01-28 06:53:59,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:53:59,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:53:59,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:53:59,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:53:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:53:58" (1/3) ... [2023-01-28 06:53:59,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4e5581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:53:59, skipping insertion in model container [2023-01-28 06:53:59,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:53:58" (2/3) ... [2023-01-28 06:53:59,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4e5581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:53:59, skipping insertion in model container [2023-01-28 06:53:59,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:53:59" (3/3) ... [2023-01-28 06:53:59,546 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2023-01-28 06:53:59,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:53:59,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:53:59,557 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:53:59,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:53:59,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2023-01-28 06:53:59,660 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2023-01-28 06:53:59,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:53:59,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-28 06:53:59,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2023-01-28 06:53:59,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2023-01-28 06:53:59,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:53:59,680 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2023-01-28 06:53:59,686 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2023-01-28 06:53:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2023-01-28 06:53:59,717 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2023-01-28 06:53:59,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:53:59,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-28 06:53:59,720 INFO L119 LiptonReduction]: Number of co-enabled transitions 1994 [2023-01-28 06:54:03,053 INFO L134 LiptonReduction]: Checked pairs total: 5945 [2023-01-28 06:54:03,053 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-28 06:54:03,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:54:03,078 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;@22284a72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:54:03,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:54:03,082 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 06:54:03,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:54:03,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:03,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:54:03,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:03,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 457006274, now seen corresponding path program 1 times [2023-01-28 06:54:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:03,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895586886] [2023-01-28 06:54:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:03,439 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 06:54:03,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:03,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895586886] [2023-01-28 06:54:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895586886] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:03,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:54:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348281999] [2023-01-28 06:54:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:54:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:54:03,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:54:03,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-01-28 06:54:03,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 06:54:03,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:03,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-01-28 06:54:03,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:03,640 INFO L130 PetriNetUnfolder]: 711/1130 cut-off events. [2023-01-28 06:54:03,640 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:54:03,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 1130 events. 711/1130 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5350 event pairs, 197 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 2238. Up to 859 conditions per place. [2023-01-28 06:54:03,646 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 27 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-01-28 06:54:03,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2023-01-28 06:54:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:54:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:54:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-01-28 06:54:03,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179738562091504 [2023-01-28 06:54:03,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-01-28 06:54:03,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-01-28 06:54:03,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:03,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-01-28 06:54:03,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 06:54:03,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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 06:54:03,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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 06:54:03,664 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 317 transitions. [2023-01-28 06:54:03,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2023-01-28 06:54:03,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:54:03,667 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-01-28 06:54:03,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-28 06:54:03,671 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-28 06:54:03,671 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-01-28 06:54:03,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 06:54:03,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:03,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:54:03,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:03,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1421136244, now seen corresponding path program 1 times [2023-01-28 06:54:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964034511] [2023-01-28 06:54:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:04,089 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 06:54:04,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964034511] [2023-01-28 06:54:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964034511] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:04,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:54:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609273852] [2023-01-28 06:54:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:04,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:54:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:54:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:54:04,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:04,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:04,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:04,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:04,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:04,345 INFO L130 PetriNetUnfolder]: 1433/2124 cut-off events. [2023-01-28 06:54:04,345 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-01-28 06:54:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 2124 events. 1433/2124 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8791 event pairs, 429 based on Foata normal form. 70/2194 useless extension candidates. Maximal degree in co-relation 4424. Up to 1392 conditions per place. [2023-01-28 06:54:04,354 INFO L137 encePairwiseOnDemand]: 195/204 looper letters, 34 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2023-01-28 06:54:04,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 180 flow [2023-01-28 06:54:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:54:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:54:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 368 transitions. [2023-01-28 06:54:04,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2023-01-28 06:54:04,359 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 368 transitions. [2023-01-28 06:54:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 368 transitions. [2023-01-28 06:54:04,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:04,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 368 transitions. [2023-01-28 06:54:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:04,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:04,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:04,363 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 4 states and 368 transitions. [2023-01-28 06:54:04,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 180 flow [2023-01-28 06:54:04,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:04,366 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 110 flow [2023-01-28 06:54:04,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-01-28 06:54:04,367 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-28 06:54:04,367 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 110 flow [2023-01-28 06:54:04,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:04,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:04,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:04,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:54:04,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:04,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash -111199132, now seen corresponding path program 1 times [2023-01-28 06:54:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423205519] [2023-01-28 06:54:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:04,831 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 06:54:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423205519] [2023-01-28 06:54:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423205519] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:54:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744816822] [2023-01-28 06:54:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:04,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:54:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:54:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:54:04,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:04,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:04,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:04,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:04,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:05,105 INFO L130 PetriNetUnfolder]: 1512/2239 cut-off events. [2023-01-28 06:54:05,105 INFO L131 PetriNetUnfolder]: For 772/772 co-relation queries the response was YES. [2023-01-28 06:54:05,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6087 conditions, 2239 events. 1512/2239 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9728 event pairs, 299 based on Foata normal form. 12/2251 useless extension candidates. Maximal degree in co-relation 6074. Up to 1867 conditions per place. [2023-01-28 06:54:05,116 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 41 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2023-01-28 06:54:05,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 322 flow [2023-01-28 06:54:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:54:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:54:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2023-01-28 06:54:05,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644607843137255 [2023-01-28 06:54:05,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2023-01-28 06:54:05,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2023-01-28 06:54:05,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:05,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2023-01-28 06:54:05,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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 06:54:05,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:05,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:05,120 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 110 flow. Second operand 4 states and 379 transitions. [2023-01-28 06:54:05,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 322 flow [2023-01-28 06:54:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:05,123 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 218 flow [2023-01-28 06:54:05,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2023-01-28 06:54:05,124 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-01-28 06:54:05,124 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 218 flow [2023-01-28 06:54:05,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:05,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:05,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:54:05,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:05,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash 845197683, now seen corresponding path program 1 times [2023-01-28 06:54:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608429303] [2023-01-28 06:54:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:05,485 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 06:54:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608429303] [2023-01-28 06:54:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608429303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:54:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259759587] [2023-01-28 06:54:05,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:05,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:54:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:54:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:54:05,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-01-28 06:54:05,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:05,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:05,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-01-28 06:54:05,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:05,731 INFO L130 PetriNetUnfolder]: 1265/1976 cut-off events. [2023-01-28 06:54:05,731 INFO L131 PetriNetUnfolder]: For 2169/2219 co-relation queries the response was YES. [2023-01-28 06:54:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7133 conditions, 1976 events. 1265/1976 cut-off events. For 2169/2219 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9451 event pairs, 270 based on Foata normal form. 44/1951 useless extension candidates. Maximal degree in co-relation 7117. Up to 1517 conditions per place. [2023-01-28 06:54:05,743 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 48 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-01-28 06:54:05,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 450 flow [2023-01-28 06:54:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:54:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:54:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-01-28 06:54:05,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2023-01-28 06:54:05,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-01-28 06:54:05,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-01-28 06:54:05,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:05,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-01-28 06:54:05,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 06:54:05,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:05,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 06:54:05,747 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 218 flow. Second operand 4 states and 402 transitions. [2023-01-28 06:54:05,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 450 flow [2023-01-28 06:54:05,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 428 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-01-28 06:54:05,753 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 282 flow [2023-01-28 06:54:05,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-01-28 06:54:05,754 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-28 06:54:05,754 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 282 flow [2023-01-28 06:54:05,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:05,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:05,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:54:05,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:05,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 302311350, now seen corresponding path program 1 times [2023-01-28 06:54:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:05,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626973066] [2023-01-28 06:54:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:06,035 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 06:54:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626973066] [2023-01-28 06:54:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626973066] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:54:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900452234] [2023-01-28 06:54:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:06,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:54:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:54:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:54:06,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:06,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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 06:54:06,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:06,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:06,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:06,385 INFO L130 PetriNetUnfolder]: 1612/2393 cut-off events. [2023-01-28 06:54:06,385 INFO L131 PetriNetUnfolder]: For 2154/2154 co-relation queries the response was YES. [2023-01-28 06:54:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8563 conditions, 2393 events. 1612/2393 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10402 event pairs, 204 based on Foata normal form. 14/2407 useless extension candidates. Maximal degree in co-relation 8544. Up to 1729 conditions per place. [2023-01-28 06:54:06,397 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 60 selfloop transitions, 33 changer transitions 0/93 dead transitions. [2023-01-28 06:54:06,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 93 transitions, 673 flow [2023-01-28 06:54:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:54:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:54:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2023-01-28 06:54:06,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591503267973856 [2023-01-28 06:54:06,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2023-01-28 06:54:06,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2023-01-28 06:54:06,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:06,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2023-01-28 06:54:06,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 06:54:06,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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 06:54:06,402 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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 06:54:06,402 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 282 flow. Second operand 6 states and 562 transitions. [2023-01-28 06:54:06,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 93 transitions, 673 flow [2023-01-28 06:54:06,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 654 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:06,407 INFO L231 Difference]: Finished difference. Result has 49 places, 58 transitions, 470 flow [2023-01-28 06:54:06,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=49, PETRI_TRANSITIONS=58} [2023-01-28 06:54:06,408 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-01-28 06:54:06,408 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 58 transitions, 470 flow [2023-01-28 06:54:06,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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 06:54:06,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:06,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:06,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:54:06,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:06,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 242344950, now seen corresponding path program 2 times [2023-01-28 06:54:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575962845] [2023-01-28 06:54:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:06,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:06,859 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 06:54:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575962845] [2023-01-28 06:54:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575962845] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:06,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:06,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246869415] [2023-01-28 06:54:06,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:06,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:06,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:06,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 58 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 06:54:06,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:06,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:06,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:07,272 INFO L130 PetriNetUnfolder]: 1704/2531 cut-off events. [2023-01-28 06:54:07,273 INFO L131 PetriNetUnfolder]: For 4786/4786 co-relation queries the response was YES. [2023-01-28 06:54:07,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10711 conditions, 2531 events. 1704/2531 cut-off events. For 4786/4786 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11185 event pairs, 174 based on Foata normal form. 24/2555 useless extension candidates. Maximal degree in co-relation 10689. Up to 1645 conditions per place. [2023-01-28 06:54:07,294 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 68 selfloop transitions, 31 changer transitions 0/99 dead transitions. [2023-01-28 06:54:07,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 866 flow [2023-01-28 06:54:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:54:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:54:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2023-01-28 06:54:07,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534313725490196 [2023-01-28 06:54:07,297 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 555 transitions. [2023-01-28 06:54:07,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 555 transitions. [2023-01-28 06:54:07,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:07,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 555 transitions. [2023-01-28 06:54:07,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 06:54:07,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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 06:54:07,300 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states 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 06:54:07,301 INFO L175 Difference]: Start difference. First operand has 49 places, 58 transitions, 470 flow. Second operand 6 states and 555 transitions. [2023-01-28 06:54:07,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 866 flow [2023-01-28 06:54:07,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 840 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:07,316 INFO L231 Difference]: Finished difference. Result has 57 places, 67 transitions, 657 flow [2023-01-28 06:54:07,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=657, PETRI_PLACES=57, PETRI_TRANSITIONS=67} [2023-01-28 06:54:07,317 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2023-01-28 06:54:07,317 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 67 transitions, 657 flow [2023-01-28 06:54:07,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 06:54:07,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:07,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:07,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:54:07,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:07,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:07,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1831091167, now seen corresponding path program 1 times [2023-01-28 06:54:07,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:07,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271911358] [2023-01-28 06:54:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:07,737 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 06:54:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271911358] [2023-01-28 06:54:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271911358] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:54:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073063857] [2023-01-28 06:54:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:07,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:54:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:54:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:54:07,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:07,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 67 transitions, 657 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 06:54:07,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:07,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:07,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:08,245 INFO L130 PetriNetUnfolder]: 1854/2745 cut-off events. [2023-01-28 06:54:08,246 INFO L131 PetriNetUnfolder]: For 7715/7715 co-relation queries the response was YES. [2023-01-28 06:54:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13625 conditions, 2745 events. 1854/2745 cut-off events. For 7715/7715 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12214 event pairs, 259 based on Foata normal form. 12/2757 useless extension candidates. Maximal degree in co-relation 13598. Up to 1891 conditions per place. [2023-01-28 06:54:08,263 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 88 selfloop transitions, 63 changer transitions 0/151 dead transitions. [2023-01-28 06:54:08,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 151 transitions, 1623 flow [2023-01-28 06:54:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:54:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:54:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 740 transitions. [2023-01-28 06:54:08,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534313725490196 [2023-01-28 06:54:08,266 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 740 transitions. [2023-01-28 06:54:08,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 740 transitions. [2023-01-28 06:54:08,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:08,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 740 transitions. [2023-01-28 06:54:08,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.5) internal successors, (740), 8 states have internal predecessors, (740), 0 states have call successors, (0), 0 states 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 06:54:08,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 06:54:08,269 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 06:54:08,269 INFO L175 Difference]: Start difference. First operand has 57 places, 67 transitions, 657 flow. Second operand 8 states and 740 transitions. [2023-01-28 06:54:08,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 151 transitions, 1623 flow [2023-01-28 06:54:08,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 151 transitions, 1586 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:08,285 INFO L231 Difference]: Finished difference. Result has 68 places, 105 transitions, 1328 flow [2023-01-28 06:54:08,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1328, PETRI_PLACES=68, PETRI_TRANSITIONS=105} [2023-01-28 06:54:08,285 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-01-28 06:54:08,286 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 105 transitions, 1328 flow [2023-01-28 06:54:08,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 06:54:08,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:08,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:08,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:54:08,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:08,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1137879893, now seen corresponding path program 2 times [2023-01-28 06:54:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136070940] [2023-01-28 06:54:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:08,707 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 06:54:08,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136070940] [2023-01-28 06:54:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136070940] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557782565] [2023-01-28 06:54:08,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:08,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:08,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:08,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 06:54:08,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 105 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 06:54:08,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:08,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 06:54:08,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:09,049 INFO L130 PetriNetUnfolder]: 1566/2459 cut-off events. [2023-01-28 06:54:09,049 INFO L131 PetriNetUnfolder]: For 15043/15177 co-relation queries the response was YES. [2023-01-28 06:54:09,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15260 conditions, 2459 events. 1566/2459 cut-off events. For 15043/15177 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12125 event pairs, 268 based on Foata normal form. 82/2539 useless extension candidates. Maximal degree in co-relation 15227. Up to 1648 conditions per place. [2023-01-28 06:54:09,064 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 71 selfloop transitions, 41 changer transitions 0/134 dead transitions. [2023-01-28 06:54:09,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 134 transitions, 1786 flow [2023-01-28 06:54:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:54:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:54:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2023-01-28 06:54:09,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48627450980392156 [2023-01-28 06:54:09,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:09,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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 06:54:09,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:09,069 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:09,069 INFO L175 Difference]: Start difference. First operand has 68 places, 105 transitions, 1328 flow. Second operand 5 states and 496 transitions. [2023-01-28 06:54:09,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 134 transitions, 1786 flow [2023-01-28 06:54:09,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 134 transitions, 1730 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:09,092 INFO L231 Difference]: Finished difference. Result has 72 places, 113 transitions, 1527 flow [2023-01-28 06:54:09,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1527, PETRI_PLACES=72, PETRI_TRANSITIONS=113} [2023-01-28 06:54:09,094 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2023-01-28 06:54:09,094 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 113 transitions, 1527 flow [2023-01-28 06:54:09,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 06:54:09,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:09,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:09,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:54:09,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:09,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1077999983, now seen corresponding path program 3 times [2023-01-28 06:54:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422199347] [2023-01-28 06:54:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:09,378 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 06:54:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422199347] [2023-01-28 06:54:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422199347] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20142840] [2023-01-28 06:54:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:09,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:09,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 06:54:09,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 113 transitions, 1527 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 06:54:09,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:09,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 06:54:09,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:09,728 INFO L130 PetriNetUnfolder]: 1592/2498 cut-off events. [2023-01-28 06:54:09,728 INFO L131 PetriNetUnfolder]: For 18545/18657 co-relation queries the response was YES. [2023-01-28 06:54:09,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16474 conditions, 2498 events. 1592/2498 cut-off events. For 18545/18657 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12388 event pairs, 279 based on Foata normal form. 60/2552 useless extension candidates. Maximal degree in co-relation 16438. Up to 1689 conditions per place. [2023-01-28 06:54:09,743 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 82 selfloop transitions, 45 changer transitions 0/149 dead transitions. [2023-01-28 06:54:09,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 149 transitions, 2125 flow [2023-01-28 06:54:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:54:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:54:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2023-01-28 06:54:09,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48627450980392156 [2023-01-28 06:54:09,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:09,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 496 transitions. [2023-01-28 06:54:09,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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 06:54:09,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:09,749 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:09,749 INFO L175 Difference]: Start difference. First operand has 72 places, 113 transitions, 1527 flow. Second operand 5 states and 496 transitions. [2023-01-28 06:54:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 149 transitions, 2125 flow [2023-01-28 06:54:09,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 149 transitions, 2043 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-28 06:54:09,778 INFO L231 Difference]: Finished difference. Result has 75 places, 127 transitions, 1833 flow [2023-01-28 06:54:09,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1833, PETRI_PLACES=75, PETRI_TRANSITIONS=127} [2023-01-28 06:54:09,778 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2023-01-28 06:54:09,779 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 127 transitions, 1833 flow [2023-01-28 06:54:09,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 06:54:09,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:09,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:09,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:54:09,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:09,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -86302853, now seen corresponding path program 4 times [2023-01-28 06:54:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013356375] [2023-01-28 06:54:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:09,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:10,179 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 06:54:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:10,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013356375] [2023-01-28 06:54:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013356375] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263064526] [2023-01-28 06:54:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:10,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:10,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 06:54:10,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 127 transitions, 1833 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 06:54:10,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:10,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 06:54:10,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:10,661 INFO L130 PetriNetUnfolder]: 2101/3126 cut-off events. [2023-01-28 06:54:10,661 INFO L131 PetriNetUnfolder]: For 25672/25672 co-relation queries the response was YES. [2023-01-28 06:54:10,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20584 conditions, 3126 events. 2101/3126 cut-off events. For 25672/25672 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14605 event pairs, 285 based on Foata normal form. 30/3156 useless extension candidates. Maximal degree in co-relation 20546. Up to 1991 conditions per place. [2023-01-28 06:54:10,679 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 112 selfloop transitions, 94 changer transitions 0/206 dead transitions. [2023-01-28 06:54:10,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 206 transitions, 3082 flow [2023-01-28 06:54:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:54:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:54:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-01-28 06:54:10,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530812324929972 [2023-01-28 06:54:10,681 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-01-28 06:54:10,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-01-28 06:54:10,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:10,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-01-28 06:54:10,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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 06:54:10,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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 06:54:10,684 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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 06:54:10,684 INFO L175 Difference]: Start difference. First operand has 75 places, 127 transitions, 1833 flow. Second operand 7 states and 647 transitions. [2023-01-28 06:54:10,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 206 transitions, 3082 flow [2023-01-28 06:54:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 206 transitions, 3023 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:10,725 INFO L231 Difference]: Finished difference. Result has 83 places, 166 transitions, 2739 flow [2023-01-28 06:54:10,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2739, PETRI_PLACES=83, PETRI_TRANSITIONS=166} [2023-01-28 06:54:10,725 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2023-01-28 06:54:10,725 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 166 transitions, 2739 flow [2023-01-28 06:54:10,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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 06:54:10,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:10,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:10,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:54:10,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:10,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1912852664, now seen corresponding path program 1 times [2023-01-28 06:54:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550376840] [2023-01-28 06:54:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:10,841 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 06:54:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550376840] [2023-01-28 06:54:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550376840] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:10,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:54:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726276199] [2023-01-28 06:54:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:54:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:54:10,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:54:10,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 06:54:10,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 166 transitions, 2739 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:10,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:10,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 06:54:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:11,157 INFO L130 PetriNetUnfolder]: 1114/1811 cut-off events. [2023-01-28 06:54:11,158 INFO L131 PetriNetUnfolder]: For 41000/41986 co-relation queries the response was YES. [2023-01-28 06:54:11,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13944 conditions, 1811 events. 1114/1811 cut-off events. For 41000/41986 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9563 event pairs, 124 based on Foata normal form. 591/2363 useless extension candidates. Maximal degree in co-relation 13902. Up to 994 conditions per place. [2023-01-28 06:54:11,171 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 188 selfloop transitions, 8 changer transitions 24/257 dead transitions. [2023-01-28 06:54:11,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 257 transitions, 4866 flow [2023-01-28 06:54:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:54:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:54:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-01-28 06:54:11,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872549019607843 [2023-01-28 06:54:11,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-01-28 06:54:11,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-01-28 06:54:11,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:11,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-01-28 06:54:11,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 06:54:11,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:11,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:11,176 INFO L175 Difference]: Start difference. First operand has 83 places, 166 transitions, 2739 flow. Second operand 5 states and 497 transitions. [2023-01-28 06:54:11,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 257 transitions, 4866 flow [2023-01-28 06:54:11,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 257 transitions, 4580 flow, removed 93 selfloop flow, removed 4 redundant places. [2023-01-28 06:54:11,208 INFO L231 Difference]: Finished difference. Result has 86 places, 135 transitions, 2115 flow [2023-01-28 06:54:11,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2115, PETRI_PLACES=86, PETRI_TRANSITIONS=135} [2023-01-28 06:54:11,209 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2023-01-28 06:54:11,209 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 135 transitions, 2115 flow [2023-01-28 06:54:11,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:11,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:11,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:11,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:54:11,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:11,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 404804734, now seen corresponding path program 1 times [2023-01-28 06:54:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019958701] [2023-01-28 06:54:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:11,333 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 06:54:11,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019958701] [2023-01-28 06:54:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019958701] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370324830] [2023-01-28 06:54:11,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:11,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:54:11,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:54:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:54:11,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 06:54:11,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 135 transitions, 2115 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 06:54:11,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:11,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 06:54:11,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:11,576 INFO L130 PetriNetUnfolder]: 857/1421 cut-off events. [2023-01-28 06:54:11,576 INFO L131 PetriNetUnfolder]: For 31133/32038 co-relation queries the response was YES. [2023-01-28 06:54:11,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10718 conditions, 1421 events. 857/1421 cut-off events. For 31133/32038 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7442 event pairs, 57 based on Foata normal form. 427/1819 useless extension candidates. Maximal degree in co-relation 10675. Up to 719 conditions per place. [2023-01-28 06:54:11,585 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 182 selfloop transitions, 15 changer transitions 33/264 dead transitions. [2023-01-28 06:54:11,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 264 transitions, 4672 flow [2023-01-28 06:54:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:54:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:54:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2023-01-28 06:54:11,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2023-01-28 06:54:11,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2023-01-28 06:54:11,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2023-01-28 06:54:11,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:11,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2023-01-28 06:54:11,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 06:54:11,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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 06:54:11,590 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states 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 06:54:11,590 INFO L175 Difference]: Start difference. First operand has 86 places, 135 transitions, 2115 flow. Second operand 7 states and 696 transitions. [2023-01-28 06:54:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 264 transitions, 4672 flow [2023-01-28 06:54:11,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 264 transitions, 4279 flow, removed 99 selfloop flow, removed 7 redundant places. [2023-01-28 06:54:11,611 INFO L231 Difference]: Finished difference. Result has 88 places, 122 transitions, 1737 flow [2023-01-28 06:54:11,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1737, PETRI_PLACES=88, PETRI_TRANSITIONS=122} [2023-01-28 06:54:11,612 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2023-01-28 06:54:11,612 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 122 transitions, 1737 flow [2023-01-28 06:54:11,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 06:54:11,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:11,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:11,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:54:11,613 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:11,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash -17340783, now seen corresponding path program 1 times [2023-01-28 06:54:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:11,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73238292] [2023-01-28 06:54:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:11,761 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 06:54:11,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:11,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73238292] [2023-01-28 06:54:11,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73238292] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:11,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:54:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528563499] [2023-01-28 06:54:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:11,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 06:54:11,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 122 transitions, 1737 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 06:54:11,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:11,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 06:54:11,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:12,017 INFO L130 PetriNetUnfolder]: 847/1398 cut-off events. [2023-01-28 06:54:12,018 INFO L131 PetriNetUnfolder]: For 22104/22821 co-relation queries the response was YES. [2023-01-28 06:54:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 1398 events. 847/1398 cut-off events. For 22104/22821 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7319 event pairs, 51 based on Foata normal form. 281/1650 useless extension candidates. Maximal degree in co-relation 10016. Up to 699 conditions per place. [2023-01-28 06:54:12,026 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 175 selfloop transitions, 19 changer transitions 34/262 dead transitions. [2023-01-28 06:54:12,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 262 transitions, 4296 flow [2023-01-28 06:54:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:54:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:54:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2023-01-28 06:54:12,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47657952069716775 [2023-01-28 06:54:12,028 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2023-01-28 06:54:12,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2023-01-28 06:54:12,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:12,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2023-01-28 06:54:12,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 0 states have call successors, (0), 0 states 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 06:54:12,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 06:54:12,032 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states 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 06:54:12,032 INFO L175 Difference]: Start difference. First operand has 88 places, 122 transitions, 1737 flow. Second operand 9 states and 875 transitions. [2023-01-28 06:54:12,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 262 transitions, 4296 flow [2023-01-28 06:54:12,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 262 transitions, 4166 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-01-28 06:54:12,058 INFO L231 Difference]: Finished difference. Result has 95 places, 120 transitions, 1657 flow [2023-01-28 06:54:12,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1657, PETRI_PLACES=95, PETRI_TRANSITIONS=120} [2023-01-28 06:54:12,059 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2023-01-28 06:54:12,059 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 120 transitions, 1657 flow [2023-01-28 06:54:12,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states 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 06:54:12,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:12,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:12,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:54:12,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:12,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 88992645, now seen corresponding path program 1 times [2023-01-28 06:54:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932132767] [2023-01-28 06:54:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:12,415 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 06:54:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932132767] [2023-01-28 06:54:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932132767] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:54:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666616204] [2023-01-28 06:54:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:12,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:54:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:54:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:54:12,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 204 [2023-01-28 06:54:12,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 120 transitions, 1657 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 06:54:12,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:12,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 204 [2023-01-28 06:54:12,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:13,149 INFO L130 PetriNetUnfolder]: 1643/2658 cut-off events. [2023-01-28 06:54:13,149 INFO L131 PetriNetUnfolder]: For 25642/25642 co-relation queries the response was YES. [2023-01-28 06:54:13,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18778 conditions, 2658 events. 1643/2658 cut-off events. For 25642/25642 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14109 event pairs, 100 based on Foata normal form. 1/2659 useless extension candidates. Maximal degree in co-relation 18732. Up to 1146 conditions per place. [2023-01-28 06:54:13,160 INFO L137 encePairwiseOnDemand]: 192/204 looper letters, 69 selfloop transitions, 39 changer transitions 215/323 dead transitions. [2023-01-28 06:54:13,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 323 transitions, 4566 flow [2023-01-28 06:54:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 06:54:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 06:54:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1217 transitions. [2023-01-28 06:54:13,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261204481792717 [2023-01-28 06:54:13,163 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1217 transitions. [2023-01-28 06:54:13,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1217 transitions. [2023-01-28 06:54:13,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:13,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1217 transitions. [2023-01-28 06:54:13,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.92857142857143) internal successors, (1217), 14 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states 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 06:54:13,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 204.0) internal successors, (3060), 15 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states 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 06:54:13,168 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 204.0) internal successors, (3060), 15 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states 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 06:54:13,168 INFO L175 Difference]: Start difference. First operand has 95 places, 120 transitions, 1657 flow. Second operand 14 states and 1217 transitions. [2023-01-28 06:54:13,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 323 transitions, 4566 flow [2023-01-28 06:54:13,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 323 transitions, 4264 flow, removed 40 selfloop flow, removed 9 redundant places. [2023-01-28 06:54:13,219 INFO L231 Difference]: Finished difference. Result has 103 places, 77 transitions, 1172 flow [2023-01-28 06:54:13,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1172, PETRI_PLACES=103, PETRI_TRANSITIONS=77} [2023-01-28 06:54:13,220 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 69 predicate places. [2023-01-28 06:54:13,220 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 77 transitions, 1172 flow [2023-01-28 06:54:13,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 06:54:13,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:13,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:13,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:54:13,221 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:13,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -486714113, now seen corresponding path program 2 times [2023-01-28 06:54:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414283884] [2023-01-28 06:54:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:13,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:13,825 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 06:54:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:13,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414283884] [2023-01-28 06:54:13,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414283884] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:13,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:54:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456206358] [2023-01-28 06:54:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 06:54:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 06:54:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-01-28 06:54:13,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-01-28 06:54:13,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 77 transitions, 1172 flow. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states 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 06:54:13,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:13,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-01-28 06:54:13,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:14,026 INFO L130 PetriNetUnfolder]: 272/540 cut-off events. [2023-01-28 06:54:14,026 INFO L131 PetriNetUnfolder]: For 6154/6177 co-relation queries the response was YES. [2023-01-28 06:54:14,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3764 conditions, 540 events. 272/540 cut-off events. For 6154/6177 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2557 event pairs, 38 based on Foata normal form. 9/539 useless extension candidates. Maximal degree in co-relation 3728. Up to 217 conditions per place. [2023-01-28 06:54:14,030 INFO L137 encePairwiseOnDemand]: 199/204 looper letters, 60 selfloop transitions, 13 changer transitions 21/105 dead transitions. [2023-01-28 06:54:14,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 105 transitions, 1591 flow [2023-01-28 06:54:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:54:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:54:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2023-01-28 06:54:14,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-01-28 06:54:14,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 470 transitions. [2023-01-28 06:54:14,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 470 transitions. [2023-01-28 06:54:14,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:14,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 470 transitions. [2023-01-28 06:54:14,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 06:54:14,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:14,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 06:54:14,035 INFO L175 Difference]: Start difference. First operand has 103 places, 77 transitions, 1172 flow. Second operand 5 states and 470 transitions. [2023-01-28 06:54:14,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 105 transitions, 1591 flow [2023-01-28 06:54:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 1393 flow, removed 45 selfloop flow, removed 16 redundant places. [2023-01-28 06:54:14,049 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 947 flow [2023-01-28 06:54:14,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=947, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2023-01-28 06:54:14,050 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2023-01-28 06:54:14,050 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 947 flow [2023-01-28 06:54:14,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states 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 06:54:14,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:14,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:14,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:54:14,051 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:54:14,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2133791713, now seen corresponding path program 3 times [2023-01-28 06:54:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916911640] [2023-01-28 06:54:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:54:14,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:54:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:54:14,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:54:14,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:54:14,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:54:14,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:54:14,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:54:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:54:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:54:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:54:14,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:54:14,145 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:14,149 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:54:14,149 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:54:14,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:54:14 BasicIcfg [2023-01-28 06:54:14,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:54:14,204 INFO L158 Benchmark]: Toolchain (without parser) took 15667.11ms. Allocated memory was 377.5MB in the beginning and 792.7MB in the end (delta: 415.2MB). Free memory was 327.6MB in the beginning and 591.9MB in the end (delta: -264.3MB). Peak memory consumption was 151.5MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,204 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:54:14,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.14ms. Allocated memory is still 377.5MB. Free memory was 327.3MB in the beginning and 304.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.93ms. Allocated memory is still 377.5MB. Free memory was 304.2MB in the beginning and 352.7MB in the end (delta: -48.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,205 INFO L158 Benchmark]: Boogie Preprocessor took 19.96ms. Allocated memory is still 377.5MB. Free memory was 352.7MB in the beginning and 350.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,205 INFO L158 Benchmark]: RCFGBuilder took 477.86ms. Allocated memory is still 377.5MB. Free memory was 350.3MB in the beginning and 312.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,205 INFO L158 Benchmark]: TraceAbstraction took 14660.72ms. Allocated memory was 377.5MB in the beginning and 792.7MB in the end (delta: 415.2MB). Free memory was 311.8MB in the beginning and 591.9MB in the end (delta: -280.1MB). Peak memory consumption was 133.8MB. Max. memory is 16.0GB. [2023-01-28 06:54:14,206 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.14ms. Allocated memory is still 377.5MB. Free memory was 327.3MB in the beginning and 304.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.93ms. Allocated memory is still 377.5MB. Free memory was 304.2MB in the beginning and 352.7MB in the end (delta: -48.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.96ms. Allocated memory is still 377.5MB. Free memory was 352.7MB in the beginning and 350.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 477.86ms. Allocated memory is still 377.5MB. Free memory was 350.3MB in the beginning and 312.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 14660.72ms. Allocated memory was 377.5MB in the beginning and 792.7MB in the end (delta: 415.2MB). Free memory was 311.8MB in the beginning and 591.9MB in the end (delta: -280.1MB). Peak memory consumption was 133.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 114 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 24 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 5945 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2605, independent: 2404, independent conditional: 0, independent unconditional: 2404, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1092, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2605, independent: 1351, independent conditional: 0, independent unconditional: 1351, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1092, unknown conditional: 0, unknown unconditional: 1092] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=-2, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=-1, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1722 IncrementalHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 58 mSDtfsCounter, 1722 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2739occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 06:54:14,226 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...