/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:49:39,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:49:39,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:49:39,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:49:39,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:49:39,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:49:39,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:49:39,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:49:39,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:49:39,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:49:39,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:49:39,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:49:39,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:49:39,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:49:39,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:49:39,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:49:39,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:49:39,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:49:39,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:49:39,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:49:39,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:49:39,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:49:39,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:49:39,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:49:39,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:49:39,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:49:39,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:49:39,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:49:39,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:49:39,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:49:39,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:49:39,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:49:39,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:49:39,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:49:39,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:49:39,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:49:39,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:49:39,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:49:39,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:49:39,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:49:39,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:49:39,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:49:39,142 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:49:39,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:49:39,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:49:39,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:49:39,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:49:39,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:49:39,144 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:49:39,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:49:39,144 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:49:39,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:49:39,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:49:39,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:49:39,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:49:39,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:49:39,147 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:49:39,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:49:39,147 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:49:39,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:49:39,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:49:39,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:49:39,335 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:49:39,335 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:49:39,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:49:40,291 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:49:40,476 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:49:40,477 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:49:40,485 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05138cb45/e59f28ac6da84dcabf7132ef48443de7/FLAG9adb8df31 [2023-01-28 00:49:40,496 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05138cb45/e59f28ac6da84dcabf7132ef48443de7 [2023-01-28 00:49:40,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:49:40,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:49:40,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:49:40,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:49:40,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:49:40,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:40,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab54d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40, skipping insertion in model container [2023-01-28 00:49:40,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:40,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:49:40,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:49:40,642 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 00:49:40,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:49:40,849 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:49:40,858 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 00:49:40,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:49:40,941 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:49:40,941 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:49:40,946 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:49:40,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40 WrapperNode [2023-01-28 00:49:40,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:49:40,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:49:40,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:49:40,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:49:40,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:40,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,005 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-01-28 00:49:41,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:49:41,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:49:41,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:49:41,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:49:41,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:49:41,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:49:41,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:49:41,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:49:41,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (1/1) ... [2023-01-28 00:49:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:49:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:49:41,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:49:41,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:49:41,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:49:41,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:49:41,129 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:49:41,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:49:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:49:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:49:41,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:49:41,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:49:41,131 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:49:41,280 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:49:41,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:49:41,641 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:49:41,783 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:49:41,783 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:49:41,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:49:41 BoogieIcfgContainer [2023-01-28 00:49:41,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:49:41,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:49:41,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:49:41,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:49:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:49:40" (1/3) ... [2023-01-28 00:49:41,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774fcf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:49:41, skipping insertion in model container [2023-01-28 00:49:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:49:40" (2/3) ... [2023-01-28 00:49:41,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774fcf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:49:41, skipping insertion in model container [2023-01-28 00:49:41,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:49:41" (3/3) ... [2023-01-28 00:49:41,790 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 00:49:41,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:49:41,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:49:41,803 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:49:41,850 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:49:41,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 00:49:41,923 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 00:49:41,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 00:49:41,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 00:49:41,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-28 00:49:41,939 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:49:41,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 00:49:41,957 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 00:49:41,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-28 00:49:41,987 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 00:49:41,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:41,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 00:49:41,990 INFO L119 LiptonReduction]: Number of co-enabled transitions 1876 [2023-01-28 00:49:45,478 INFO L134 LiptonReduction]: Checked pairs total: 4825 [2023-01-28 00:49:45,478 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-01-28 00:49:45,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:49:45,501 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;@59d39e35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:49:45,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:49:45,510 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-01-28 00:49:45,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:49:45,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:45,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:45,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:45,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1231917894, now seen corresponding path program 1 times [2023-01-28 00:49:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577131050] [2023-01-28 00:49:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577131050] [2023-01-28 00:49:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577131050] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:49:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086659099] [2023-01-28 00:49:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:45,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:49:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:49:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:49:45,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-01-28 00:49:45,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:45,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:45,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-01-28 00:49:45,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:46,169 INFO L130 PetriNetUnfolder]: 1107/1764 cut-off events. [2023-01-28 00:49:46,169 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-01-28 00:49:46,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1764 events. 1107/1764 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8236 event pairs, 249 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 3460. Up to 1219 conditions per place. [2023-01-28 00:49:46,178 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 29 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-01-28 00:49:46,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 143 flow [2023-01-28 00:49:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-01-28 00:49:46,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066006600660066 [2023-01-28 00:49:46,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-01-28 00:49:46,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-01-28 00:49:46,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:46,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-01-28 00:49:46,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,198 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 307 transitions. [2023-01-28 00:49:46,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 143 flow [2023-01-28 00:49:46,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:49:46,201 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-28 00:49:46,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-28 00:49:46,204 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-28 00:49:46,204 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-28 00:49:46,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:46,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:46,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:49:46,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:46,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1537841442, now seen corresponding path program 1 times [2023-01-28 00:49:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:46,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197920029] [2023-01-28 00:49:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197920029] [2023-01-28 00:49:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197920029] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:46,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:46,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473435125] [2023-01-28 00:49:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:46,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:46,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 202 [2023-01-28 00:49:46,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:46,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 202 [2023-01-28 00:49:46,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:46,802 INFO L130 PetriNetUnfolder]: 1250/1861 cut-off events. [2023-01-28 00:49:46,803 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2023-01-28 00:49:46,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 1861 events. 1250/1861 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8009 event pairs, 256 based on Foata normal form. 36/1897 useless extension candidates. Maximal degree in co-relation 3864. Up to 1596 conditions per place. [2023-01-28 00:49:46,810 INFO L137 encePairwiseOnDemand]: 192/202 looper letters, 35 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-01-28 00:49:46,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 200 flow [2023-01-28 00:49:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:49:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:49:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 364 transitions. [2023-01-28 00:49:46,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504950495049505 [2023-01-28 00:49:46,813 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 364 transitions. [2023-01-28 00:49:46,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 364 transitions. [2023-01-28 00:49:46,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:46,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 364 transitions. [2023-01-28 00:49:46,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,816 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,816 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 364 transitions. [2023-01-28 00:49:46,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 200 flow [2023-01-28 00:49:46,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:46,817 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 118 flow [2023-01-28 00:49:46,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2023-01-28 00:49:46,818 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-28 00:49:46,818 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 118 flow [2023-01-28 00:49:46,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:46,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:46,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:46,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:49:46,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:46,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -428445371, now seen corresponding path program 1 times [2023-01-28 00:49:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:46,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680664997] [2023-01-28 00:49:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:47,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680664997] [2023-01-28 00:49:47,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680664997] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:47,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:47,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:49:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731036980] [2023-01-28 00:49:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:47,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:49:47,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:49:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:49:47,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-01-28 00:49:47,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:47,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-01-28 00:49:47,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:47,235 INFO L130 PetriNetUnfolder]: 1028/1564 cut-off events. [2023-01-28 00:49:47,235 INFO L131 PetriNetUnfolder]: For 569/582 co-relation queries the response was YES. [2023-01-28 00:49:47,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 1564 events. 1028/1564 cut-off events. For 569/582 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6576 event pairs, 356 based on Foata normal form. 67/1631 useless extension candidates. Maximal degree in co-relation 4365. Up to 877 conditions per place. [2023-01-28 00:49:47,242 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 40 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-01-28 00:49:47,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 259 flow [2023-01-28 00:49:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-01-28 00:49:47,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016501650165016 [2023-01-28 00:49:47,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-01-28 00:49:47,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-01-28 00:49:47,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:47,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-01-28 00:49:47,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,246 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 118 flow. Second operand 3 states and 304 transitions. [2023-01-28 00:49:47,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 259 flow [2023-01-28 00:49:47,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 259 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:49:47,248 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 129 flow [2023-01-28 00:49:47,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-01-28 00:49:47,249 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-01-28 00:49:47,249 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 129 flow [2023-01-28 00:49:47,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:47,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:47,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:49:47,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:47,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1686629880, now seen corresponding path program 1 times [2023-01-28 00:49:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235400568] [2023-01-28 00:49:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235400568] [2023-01-28 00:49:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235400568] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224305673] [2023-01-28 00:49:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:49:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:49:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:49:47,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:49:47,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:47,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:47,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:49:47,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:48,279 INFO L130 PetriNetUnfolder]: 1668/2569 cut-off events. [2023-01-28 00:49:48,279 INFO L131 PetriNetUnfolder]: For 1272/1306 co-relation queries the response was YES. [2023-01-28 00:49:48,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7281 conditions, 2569 events. 1668/2569 cut-off events. For 1272/1306 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12991 event pairs, 219 based on Foata normal form. 127/2663 useless extension candidates. Maximal degree in co-relation 7266. Up to 1217 conditions per place. [2023-01-28 00:49:48,289 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 55 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-01-28 00:49:48,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 414 flow [2023-01-28 00:49:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-01-28 00:49:48,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47128712871287126 [2023-01-28 00:49:48,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-01-28 00:49:48,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-01-28 00:49:48,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:48,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-01-28 00:49:48,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:48,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:48,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:48,294 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 129 flow. Second operand 5 states and 476 transitions. [2023-01-28 00:49:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 70 transitions, 414 flow [2023-01-28 00:49:48,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 70 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:49:48,298 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 232 flow [2023-01-28 00:49:48,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2023-01-28 00:49:48,298 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-01-28 00:49:48,299 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 232 flow [2023-01-28 00:49:48,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:48,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:48,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:48,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:49:48,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:48,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash 714001974, now seen corresponding path program 1 times [2023-01-28 00:49:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671677852] [2023-01-28 00:49:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:48,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671677852] [2023-01-28 00:49:48,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671677852] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:48,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:48,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822646896] [2023-01-28 00:49:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:48,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:49:48,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:48,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:48,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:49:48,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:49,266 INFO L130 PetriNetUnfolder]: 1892/2965 cut-off events. [2023-01-28 00:49:49,267 INFO L131 PetriNetUnfolder]: For 3159/3225 co-relation queries the response was YES. [2023-01-28 00:49:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9390 conditions, 2965 events. 1892/2965 cut-off events. For 3159/3225 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15494 event pairs, 404 based on Foata normal form. 96/3061 useless extension candidates. Maximal degree in co-relation 9372. Up to 2255 conditions per place. [2023-01-28 00:49:49,281 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 45 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2023-01-28 00:49:49,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 476 flow [2023-01-28 00:49:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:49:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:49:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2023-01-28 00:49:49,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46534653465346537 [2023-01-28 00:49:49,282 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2023-01-28 00:49:49,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2023-01-28 00:49:49,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:49,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2023-01-28 00:49:49,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:49,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:49,285 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:49,285 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 232 flow. Second operand 4 states and 376 transitions. [2023-01-28 00:49:49,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 476 flow [2023-01-28 00:49:49,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:49:49,291 INFO L231 Difference]: Finished difference. Result has 45 places, 52 transitions, 405 flow [2023-01-28 00:49:49,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=45, PETRI_TRANSITIONS=52} [2023-01-28 00:49:49,293 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2023-01-28 00:49:49,293 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 52 transitions, 405 flow [2023-01-28 00:49:49,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:49,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:49,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:49,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:49:49,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:49,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1306986916, now seen corresponding path program 1 times [2023-01-28 00:49:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583333089] [2023-01-28 00:49:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:50,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583333089] [2023-01-28 00:49:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583333089] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:50,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:49:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084877583] [2023-01-28 00:49:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:49:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:49:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:49:50,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 202 [2023-01-28 00:49:50,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 52 transitions, 405 flow. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:50,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:50,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 202 [2023-01-28 00:49:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:50,972 INFO L130 PetriNetUnfolder]: 1884/2968 cut-off events. [2023-01-28 00:49:50,972 INFO L131 PetriNetUnfolder]: For 6005/6026 co-relation queries the response was YES. [2023-01-28 00:49:50,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10692 conditions, 2968 events. 1884/2968 cut-off events. For 6005/6026 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15301 event pairs, 207 based on Foata normal form. 25/2993 useless extension candidates. Maximal degree in co-relation 10671. Up to 2323 conditions per place. [2023-01-28 00:49:50,984 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 72 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-01-28 00:49:50,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 737 flow [2023-01-28 00:49:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2023-01-28 00:49:50,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44752475247524753 [2023-01-28 00:49:50,986 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 452 transitions. [2023-01-28 00:49:50,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 452 transitions. [2023-01-28 00:49:50,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:50,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 452 transitions. [2023-01-28 00:49:50,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:50,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:50,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:50,990 INFO L175 Difference]: Start difference. First operand has 45 places, 52 transitions, 405 flow. Second operand 5 states and 452 transitions. [2023-01-28 00:49:50,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 737 flow [2023-01-28 00:49:50,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:49:50,995 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 503 flow [2023-01-28 00:49:50,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=503, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2023-01-28 00:49:50,997 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-01-28 00:49:50,997 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 503 flow [2023-01-28 00:49:50,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:50,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:50,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:50,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:49:50,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:50,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1763809982, now seen corresponding path program 1 times [2023-01-28 00:49:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:50,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367886348] [2023-01-28 00:49:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367886348] [2023-01-28 00:49:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367886348] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:49:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883453350] [2023-01-28 00:49:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:49:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:51,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:49:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:49:51,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 202 [2023-01-28 00:49:51,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:51,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:51,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 202 [2023-01-28 00:49:51,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:51,624 INFO L130 PetriNetUnfolder]: 2764/4311 cut-off events. [2023-01-28 00:49:51,624 INFO L131 PetriNetUnfolder]: For 9138/9138 co-relation queries the response was YES. [2023-01-28 00:49:51,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15964 conditions, 4311 events. 2764/4311 cut-off events. For 9138/9138 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23526 event pairs, 1275 based on Foata normal form. 28/4339 useless extension candidates. Maximal degree in co-relation 15939. Up to 2360 conditions per place. [2023-01-28 00:49:51,643 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 57 selfloop transitions, 4 changer transitions 22/83 dead transitions. [2023-01-28 00:49:51,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 870 flow [2023-01-28 00:49:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:49:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:49:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-01-28 00:49:51,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966996699669967 [2023-01-28 00:49:51,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-01-28 00:49:51,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-01-28 00:49:51,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:51,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-01-28 00:49:51,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:51,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:51,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:51,646 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 503 flow. Second operand 3 states and 301 transitions. [2023-01-28 00:49:51,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 870 flow [2023-01-28 00:49:51,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:49:51,654 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 379 flow [2023-01-28 00:49:51,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-01-28 00:49:51,654 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2023-01-28 00:49:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 379 flow [2023-01-28 00:49:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:51,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:51,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:49:51,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:51,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2036503196, now seen corresponding path program 1 times [2023-01-28 00:49:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948173253] [2023-01-28 00:49:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:52,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:52,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948173253] [2023-01-28 00:49:52,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948173253] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:52,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669325676] [2023-01-28 00:49:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:52,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:49:52,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:49:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:49:52,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-01-28 00:49:52,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:52,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:52,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-01-28 00:49:52,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:53,031 INFO L130 PetriNetUnfolder]: 2929/4852 cut-off events. [2023-01-28 00:49:53,031 INFO L131 PetriNetUnfolder]: For 11817/11870 co-relation queries the response was YES. [2023-01-28 00:49:53,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18273 conditions, 4852 events. 2929/4852 cut-off events. For 11817/11870 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 30386 event pairs, 246 based on Foata normal form. 85/4937 useless extension candidates. Maximal degree in co-relation 18247. Up to 2385 conditions per place. [2023-01-28 00:49:53,050 INFO L137 encePairwiseOnDemand]: 192/202 looper letters, 92 selfloop transitions, 50 changer transitions 30/174 dead transitions. [2023-01-28 00:49:53,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 174 transitions, 1577 flow [2023-01-28 00:49:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 00:49:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 00:49:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 983 transitions. [2023-01-28 00:49:53,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423942394239424 [2023-01-28 00:49:53,053 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 983 transitions. [2023-01-28 00:49:53,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 983 transitions. [2023-01-28 00:49:53,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:53,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 983 transitions. [2023-01-28 00:49:53,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:53,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:53,058 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:53,058 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 379 flow. Second operand 11 states and 983 transitions. [2023-01-28 00:49:53,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 174 transitions, 1577 flow [2023-01-28 00:49:53,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 174 transitions, 1563 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:49:53,070 INFO L231 Difference]: Finished difference. Result has 69 places, 92 transitions, 1013 flow [2023-01-28 00:49:53,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1013, PETRI_PLACES=69, PETRI_TRANSITIONS=92} [2023-01-28 00:49:53,071 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2023-01-28 00:49:53,072 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 92 transitions, 1013 flow [2023-01-28 00:49:53,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.28571428571429) internal successors, (576), 7 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:53,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:53,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:53,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:49:53,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:53,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash 811823436, now seen corresponding path program 2 times [2023-01-28 00:49:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837768652] [2023-01-28 00:49:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837768652] [2023-01-28 00:49:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837768652] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:49:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756473577] [2023-01-28 00:49:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:54,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:49:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:54,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:49:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:49:54,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-01-28 00:49:54,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 92 transitions, 1013 flow. Second operand has 9 states, 9 states have (on average 81.77777777777777) internal successors, (736), 9 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:54,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:54,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-01-28 00:49:54,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:55,327 INFO L130 PetriNetUnfolder]: 2808/4763 cut-off events. [2023-01-28 00:49:55,327 INFO L131 PetriNetUnfolder]: For 23064/23111 co-relation queries the response was YES. [2023-01-28 00:49:55,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22298 conditions, 4763 events. 2808/4763 cut-off events. For 23064/23111 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 30483 event pairs, 141 based on Foata normal form. 63/4826 useless extension candidates. Maximal degree in co-relation 22264. Up to 2159 conditions per place. [2023-01-28 00:49:55,352 INFO L137 encePairwiseOnDemand]: 192/202 looper letters, 97 selfloop transitions, 40 changer transitions 38/176 dead transitions. [2023-01-28 00:49:55,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 176 transitions, 2023 flow [2023-01-28 00:49:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:49:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:49:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions. [2023-01-28 00:49:55,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420792079207921 [2023-01-28 00:49:55,356 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 893 transitions. [2023-01-28 00:49:55,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 893 transitions. [2023-01-28 00:49:55,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:55,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 893 transitions. [2023-01-28 00:49:55,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,360 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,360 INFO L175 Difference]: Start difference. First operand has 69 places, 92 transitions, 1013 flow. Second operand 10 states and 893 transitions. [2023-01-28 00:49:55,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 176 transitions, 2023 flow [2023-01-28 00:49:55,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 176 transitions, 1950 flow, removed 29 selfloop flow, removed 5 redundant places. [2023-01-28 00:49:55,401 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 1203 flow [2023-01-28 00:49:55,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1203, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2023-01-28 00:49:55,401 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2023-01-28 00:49:55,401 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 1203 flow [2023-01-28 00:49:55,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 81.77777777777777) internal successors, (736), 9 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:55,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:55,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:49:55,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:55,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1156424481, now seen corresponding path program 1 times [2023-01-28 00:49:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340004232] [2023-01-28 00:49:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340004232] [2023-01-28 00:49:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340004232] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:55,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:49:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274590976] [2023-01-28 00:49:55,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:55,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:49:55,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:49:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:49:55,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:49:55,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 1203 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:55,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:49:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:55,842 INFO L130 PetriNetUnfolder]: 920/1662 cut-off events. [2023-01-28 00:49:55,842 INFO L131 PetriNetUnfolder]: For 18477/18490 co-relation queries the response was YES. [2023-01-28 00:49:55,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8338 conditions, 1662 events. 920/1662 cut-off events. For 18477/18490 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9630 event pairs, 129 based on Foata normal form. 216/1878 useless extension candidates. Maximal degree in co-relation 8299. Up to 1031 conditions per place. [2023-01-28 00:49:55,851 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 109 selfloop transitions, 4 changer transitions 101/215 dead transitions. [2023-01-28 00:49:55,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 215 transitions, 3147 flow [2023-01-28 00:49:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:49:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:49:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-01-28 00:49:55,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782178217821782 [2023-01-28 00:49:55,853 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-01-28 00:49:55,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-01-28 00:49:55,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:55,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-01-28 00:49:55,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,856 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,856 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 1203 flow. Second operand 5 states and 483 transitions. [2023-01-28 00:49:55,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 215 transitions, 3147 flow [2023-01-28 00:49:55,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 215 transitions, 3016 flow, removed 37 selfloop flow, removed 8 redundant places. [2023-01-28 00:49:55,881 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 997 flow [2023-01-28 00:49:55,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=997, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2023-01-28 00:49:55,882 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2023-01-28 00:49:55,882 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 997 flow [2023-01-28 00:49:55,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:55,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:55,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:55,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:49:55,883 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:55,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -919642235, now seen corresponding path program 1 times [2023-01-28 00:49:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566517666] [2023-01-28 00:49:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566517666] [2023-01-28 00:49:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566517666] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:56,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:56,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:49:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170027646] [2023-01-28 00:49:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:56,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:49:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:49:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:49:56,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:49:56,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 997 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:56,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:49:56,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:56,233 INFO L130 PetriNetUnfolder]: 420/843 cut-off events. [2023-01-28 00:49:56,233 INFO L131 PetriNetUnfolder]: For 9432/9436 co-relation queries the response was YES. [2023-01-28 00:49:56,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4706 conditions, 843 events. 420/843 cut-off events. For 9432/9436 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4526 event pairs, 23 based on Foata normal form. 121/964 useless extension candidates. Maximal degree in co-relation 4669. Up to 410 conditions per place. [2023-01-28 00:49:56,239 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 102 selfloop transitions, 7 changer transitions 68/178 dead transitions. [2023-01-28 00:49:56,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 178 transitions, 2540 flow [2023-01-28 00:49:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:49:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:49:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-01-28 00:49:56,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744224422442244 [2023-01-28 00:49:56,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-01-28 00:49:56,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-01-28 00:49:56,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:56,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-01-28 00:49:56,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,244 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 997 flow. Second operand 6 states and 575 transitions. [2023-01-28 00:49:56,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 178 transitions, 2540 flow [2023-01-28 00:49:56,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 178 transitions, 2518 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 00:49:56,256 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 884 flow [2023-01-28 00:49:56,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=884, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2023-01-28 00:49:56,257 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-01-28 00:49:56,257 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 884 flow [2023-01-28 00:49:56,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:56,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:56,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:49:56,257 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:56,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1203055170, now seen corresponding path program 1 times [2023-01-28 00:49:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365595830] [2023-01-28 00:49:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365595830] [2023-01-28 00:49:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365595830] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:56,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:49:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083392594] [2023-01-28 00:49:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:56,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:49:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:49:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:49:56,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-01-28 00:49:56,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:56,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-01-28 00:49:56,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:56,850 INFO L130 PetriNetUnfolder]: 220/470 cut-off events. [2023-01-28 00:49:56,850 INFO L131 PetriNetUnfolder]: For 4611/4613 co-relation queries the response was YES. [2023-01-28 00:49:56,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 470 events. 220/470 cut-off events. For 4611/4613 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2203 event pairs, 14 based on Foata normal form. 36/506 useless extension candidates. Maximal degree in co-relation 2788. Up to 202 conditions per place. [2023-01-28 00:49:56,853 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 84 selfloop transitions, 10 changer transitions 38/133 dead transitions. [2023-01-28 00:49:56,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 1894 flow [2023-01-28 00:49:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:49:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:49:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 649 transitions. [2023-01-28 00:49:56,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458981612446959 [2023-01-28 00:49:56,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 649 transitions. [2023-01-28 00:49:56,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 649 transitions. [2023-01-28 00:49:56,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:56,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 649 transitions. [2023-01-28 00:49:56,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,858 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 884 flow. Second operand 7 states and 649 transitions. [2023-01-28 00:49:56,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 1894 flow [2023-01-28 00:49:56,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 133 transitions, 1665 flow, removed 53 selfloop flow, removed 11 redundant places. [2023-01-28 00:49:56,868 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 677 flow [2023-01-28 00:49:56,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=677, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2023-01-28 00:49:56,869 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-01-28 00:49:56,869 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 677 flow [2023-01-28 00:49:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:56,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:56,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:56,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:49:56,870 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:56,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 928521768, now seen corresponding path program 1 times [2023-01-28 00:49:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105177009] [2023-01-28 00:49:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:58,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 00:49:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105177009] [2023-01-28 00:49:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105177009] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:58,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 00:49:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900518176] [2023-01-28 00:49:58,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:58,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 00:49:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 00:49:58,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-01-28 00:49:58,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 202 [2023-01-28 00:49:58,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 65 transitions, 677 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:58,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:58,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 202 [2023-01-28 00:49:58,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:58,581 INFO L130 PetriNetUnfolder]: 211/455 cut-off events. [2023-01-28 00:49:58,581 INFO L131 PetriNetUnfolder]: For 2737/2742 co-relation queries the response was YES. [2023-01-28 00:49:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 455 events. 211/455 cut-off events. For 2737/2742 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2166 event pairs, 49 based on Foata normal form. 3/457 useless extension candidates. Maximal degree in co-relation 2443. Up to 300 conditions per place. [2023-01-28 00:49:58,584 INFO L137 encePairwiseOnDemand]: 193/202 looper letters, 61 selfloop transitions, 18 changer transitions 44/124 dead transitions. [2023-01-28 00:49:58,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 1514 flow [2023-01-28 00:49:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:49:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:49:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 839 transitions. [2023-01-28 00:49:58,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153465346534653 [2023-01-28 00:49:58,586 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 839 transitions. [2023-01-28 00:49:58,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 839 transitions. [2023-01-28 00:49:58,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:58,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 839 transitions. [2023-01-28 00:49:58,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.9) internal successors, (839), 10 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:58,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:58,590 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:58,590 INFO L175 Difference]: Start difference. First operand has 73 places, 65 transitions, 677 flow. Second operand 10 states and 839 transitions. [2023-01-28 00:49:58,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 1514 flow [2023-01-28 00:49:58,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 124 transitions, 1344 flow, removed 44 selfloop flow, removed 8 redundant places. [2023-01-28 00:49:58,597 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 817 flow [2023-01-28 00:49:58,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=817, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2023-01-28 00:49:58,598 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2023-01-28 00:49:58,598 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 817 flow [2023-01-28 00:49:58,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:58,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:58,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:58,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:49:58,599 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:58,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1341595644, now seen corresponding path program 2 times [2023-01-28 00:49:58,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:58,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738672918] [2023-01-28 00:49:58,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:49:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:49:59,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:49:59,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738672918] [2023-01-28 00:49:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738672918] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:49:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:49:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:49:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456856480] [2023-01-28 00:49:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:49:59,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:49:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:49:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:49:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:49:59,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-01-28 00:49:59,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 817 flow. Second operand has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:59,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:49:59,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-01-28 00:49:59,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:49:59,635 INFO L130 PetriNetUnfolder]: 179/386 cut-off events. [2023-01-28 00:49:59,635 INFO L131 PetriNetUnfolder]: For 2336/2341 co-relation queries the response was YES. [2023-01-28 00:49:59,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2099 conditions, 386 events. 179/386 cut-off events. For 2336/2341 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1734 event pairs, 31 based on Foata normal form. 6/392 useless extension candidates. Maximal degree in co-relation 2073. Up to 197 conditions per place. [2023-01-28 00:49:59,638 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 55 selfloop transitions, 25 changer transitions 28/109 dead transitions. [2023-01-28 00:49:59,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 1294 flow [2023-01-28 00:49:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:49:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:49:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 794 transitions. [2023-01-28 00:49:59,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367436743674367 [2023-01-28 00:49:59,640 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 794 transitions. [2023-01-28 00:49:59,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 794 transitions. [2023-01-28 00:49:59,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:49:59,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 794 transitions. [2023-01-28 00:49:59,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:59,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:59,643 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:59,643 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 817 flow. Second operand 9 states and 794 transitions. [2023-01-28 00:49:59,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 1294 flow [2023-01-28 00:49:59,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 1235 flow, removed 22 selfloop flow, removed 7 redundant places. [2023-01-28 00:49:59,650 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 785 flow [2023-01-28 00:49:59,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=785, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-01-28 00:49:59,651 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2023-01-28 00:49:59,651 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 785 flow [2023-01-28 00:49:59,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.22222222222223) internal successors, (758), 9 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:49:59,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:49:59,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:49:59,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:49:59,651 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:49:59,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:49:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash 582447686, now seen corresponding path program 3 times [2023-01-28 00:49:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:49:59,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995563440] [2023-01-28 00:49:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:49:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:49:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:00,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 00:50:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995563440] [2023-01-28 00:50:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995563440] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 00:50:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736191511] [2023-01-28 00:50:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:00,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 00:50:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 00:50:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-28 00:50:00,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 202 [2023-01-28 00:50:00,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 785 flow. Second operand has 9 states, 9 states have (on average 79.33333333333333) internal successors, (714), 9 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:00,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:00,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 202 [2023-01-28 00:50:00,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:00,567 INFO L130 PetriNetUnfolder]: 161/359 cut-off events. [2023-01-28 00:50:00,567 INFO L131 PetriNetUnfolder]: For 2336/2336 co-relation queries the response was YES. [2023-01-28 00:50:00,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 359 events. 161/359 cut-off events. For 2336/2336 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1613 event pairs, 29 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 1930. Up to 179 conditions per place. [2023-01-28 00:50:00,569 INFO L137 encePairwiseOnDemand]: 191/202 looper letters, 57 selfloop transitions, 28 changer transitions 17/102 dead transitions. [2023-01-28 00:50:00,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 102 transitions, 1206 flow [2023-01-28 00:50:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:50:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:50:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2023-01-28 00:50:00,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41254125412541254 [2023-01-28 00:50:00,571 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2023-01-28 00:50:00,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2023-01-28 00:50:00,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:00,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2023-01-28 00:50:00,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:00,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:00,575 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:00,575 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 785 flow. Second operand 9 states and 750 transitions. [2023-01-28 00:50:00,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 102 transitions, 1206 flow [2023-01-28 00:50:00,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 102 transitions, 1131 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-01-28 00:50:00,581 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 846 flow [2023-01-28 00:50:00,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=846, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-01-28 00:50:00,581 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2023-01-28 00:50:00,582 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 846 flow [2023-01-28 00:50:00,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.33333333333333) internal successors, (714), 9 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:00,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:00,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:00,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:50:00,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:50:00,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1610550490, now seen corresponding path program 4 times [2023-01-28 00:50:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:00,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190313275] [2023-01-28 00:50:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:01,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190313275] [2023-01-28 00:50:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190313275] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:01,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:50:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649039952] [2023-01-28 00:50:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:01,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:50:01,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:50:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:50:01,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 202 [2023-01-28 00:50:01,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 846 flow. Second operand has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:01,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:01,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 202 [2023-01-28 00:50:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:01,558 INFO L130 PetriNetUnfolder]: 150/337 cut-off events. [2023-01-28 00:50:01,558 INFO L131 PetriNetUnfolder]: For 2213/2216 co-relation queries the response was YES. [2023-01-28 00:50:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 337 events. 150/337 cut-off events. For 2213/2216 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1483 event pairs, 16 based on Foata normal form. 4/341 useless extension candidates. Maximal degree in co-relation 1834. Up to 100 conditions per place. [2023-01-28 00:50:01,560 INFO L137 encePairwiseOnDemand]: 194/202 looper letters, 34 selfloop transitions, 13 changer transitions 66/114 dead transitions. [2023-01-28 00:50:01,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 1317 flow [2023-01-28 00:50:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 00:50:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 00:50:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 881 transitions. [2023-01-28 00:50:01,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43613861386138614 [2023-01-28 00:50:01,563 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 881 transitions. [2023-01-28 00:50:01,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 881 transitions. [2023-01-28 00:50:01,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:01,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 881 transitions. [2023-01-28 00:50:01,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.1) internal successors, (881), 10 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:01,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:01,567 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:01,567 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 846 flow. Second operand 10 states and 881 transitions. [2023-01-28 00:50:01,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 114 transitions, 1317 flow [2023-01-28 00:50:01,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 1242 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-01-28 00:50:01,573 INFO L231 Difference]: Finished difference. Result has 86 places, 40 transitions, 375 flow [2023-01-28 00:50:01,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=86, PETRI_TRANSITIONS=40} [2023-01-28 00:50:01,573 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 53 predicate places. [2023-01-28 00:50:01,573 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 40 transitions, 375 flow [2023-01-28 00:50:01,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:01,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:01,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:01,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:50:01,574 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:50:01,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1409355420, now seen corresponding path program 5 times [2023-01-28 00:50:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052447859] [2023-01-28 00:50:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:01,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:50:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:50:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:50:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052447859] [2023-01-28 00:50:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052447859] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:50:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:50:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:50:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920840074] [2023-01-28 00:50:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:50:02,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:50:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:50:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:50:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:50:02,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 202 [2023-01-28 00:50:02,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 40 transitions, 375 flow. Second operand has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:02,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:50:02,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 202 [2023-01-28 00:50:02,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:50:02,438 INFO L130 PetriNetUnfolder]: 74/190 cut-off events. [2023-01-28 00:50:02,438 INFO L131 PetriNetUnfolder]: For 953/953 co-relation queries the response was YES. [2023-01-28 00:50:02,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 190 events. 74/190 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 706 event pairs, 12 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 928. Up to 85 conditions per place. [2023-01-28 00:50:02,439 INFO L137 encePairwiseOnDemand]: 193/202 looper letters, 27 selfloop transitions, 7 changer transitions 34/68 dead transitions. [2023-01-28 00:50:02,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 696 flow [2023-01-28 00:50:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 00:50:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 00:50:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 720 transitions. [2023-01-28 00:50:02,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39603960396039606 [2023-01-28 00:50:02,441 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 720 transitions. [2023-01-28 00:50:02,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 720 transitions. [2023-01-28 00:50:02,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:50:02,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 720 transitions. [2023-01-28 00:50:02,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:02,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:02,445 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:02,445 INFO L175 Difference]: Start difference. First operand has 86 places, 40 transitions, 375 flow. Second operand 9 states and 720 transitions. [2023-01-28 00:50:02,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 696 flow [2023-01-28 00:50:02,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 550 flow, removed 21 selfloop flow, removed 21 redundant places. [2023-01-28 00:50:02,452 INFO L231 Difference]: Finished difference. Result has 66 places, 30 transitions, 180 flow [2023-01-28 00:50:02,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=66, PETRI_TRANSITIONS=30} [2023-01-28 00:50:02,453 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2023-01-28 00:50:02,453 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 30 transitions, 180 flow [2023-01-28 00:50:02,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:50:02,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:50:02,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:02,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 00:50:02,454 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:50:02,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:50:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 788916262, now seen corresponding path program 6 times [2023-01-28 00:50:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:50:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892606632] [2023-01-28 00:50:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:50:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:50:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:50:02,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:50:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:50:02,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:50:02,587 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:50:02,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:50:02,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:50:02,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:50:02,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:50:02,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:50:02,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:50:02,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 00:50:02,590 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:50:02,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:50:02,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:50:02,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:50:02 BasicIcfg [2023-01-28 00:50:02,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:50:02,650 INFO L158 Benchmark]: Toolchain (without parser) took 22151.79ms. Allocated memory was 364.9MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 324.1MB in the beginning and 944.9MB in the end (delta: -620.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. [2023-01-28 00:50:02,650 INFO L158 Benchmark]: CDTParser took 0.12ms. 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 00:50:02,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.93ms. Allocated memory is still 364.9MB. Free memory was 323.8MB in the beginning and 298.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:50:02,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 364.9MB. Free memory was 298.3MB in the beginning and 295.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:50:02,651 INFO L158 Benchmark]: Boogie Preprocessor took 49.58ms. Allocated memory is still 364.9MB. Free memory was 295.4MB in the beginning and 293.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:50:02,651 INFO L158 Benchmark]: RCFGBuilder took 728.91ms. Allocated memory is still 364.9MB. Free memory was 293.4MB in the beginning and 304.7MB in the end (delta: -11.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.0GB. [2023-01-28 00:50:02,651 INFO L158 Benchmark]: TraceAbstraction took 20863.33ms. Allocated memory was 364.9MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 304.7MB in the beginning and 944.9MB in the end (delta: -640.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:50:02,652 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 447.93ms. Allocated memory is still 364.9MB. Free memory was 323.8MB in the beginning and 298.3MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 364.9MB. Free memory was 298.3MB in the beginning and 295.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.58ms. Allocated memory is still 364.9MB. Free memory was 295.4MB in the beginning and 293.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 728.91ms. Allocated memory is still 364.9MB. Free memory was 293.4MB in the beginning and 304.7MB in the end (delta: -11.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.0GB. * TraceAbstraction took 20863.33ms. Allocated memory was 364.9MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 304.7MB in the beginning and 944.9MB in the end (delta: -640.3MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 112 PlacesBefore, 33 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 4825 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1822, independent: 1662, independent conditional: 0, independent unconditional: 1662, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 966, independent conditional: 0, independent unconditional: 966, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1822, independent: 696, independent conditional: 0, independent unconditional: 696, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1005, unknown conditional: 0, unknown unconditional: 1005] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-2, t2537={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] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-1, t2537={5:0}, t2538={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] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=0, t2537={5:0}, t2538={6:0}, t2539={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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, 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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, 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] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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=1, 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] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=1, 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] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=1, 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] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=1, 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] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: 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: 850]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1867 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 6 mSDtfsCounter, 1867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=9, InterpolantAutomatonStates: 113, 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.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 3826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:50:02,673 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...