/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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:45:03,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:45:03,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:45:03,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:45:03,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:45:03,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:45:03,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:45:03,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:45:03,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:45:03,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:45:03,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:45:03,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:45:03,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:45:03,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:45:03,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:45:03,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:45:03,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:45:03,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:45:03,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:45:03,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:45:03,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:45:03,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:45:03,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:45:03,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:45:03,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:45:03,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:45:03,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:45:03,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:45:03,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:45:03,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:45:03,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:45:03,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:45:03,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:45:03,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:45:03,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:45:03,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:45:03,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:45:03,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:45:03,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:45:03,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:45:03,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:45:03,357 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:45:03,379 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:45:03,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:45:03,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:45:03,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:45:03,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:45:03,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:45:03,381 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:45:03,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:45:03,381 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:45:03,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:45:03,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:45:03,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:45:03,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:03,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:45:03,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:45:03,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:45:03,384 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:45:03,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:45:03,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:45:03,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:45:03,592 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:45:03,593 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:45:03,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:45:04,587 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:45:04,881 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:45:04,881 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:45:04,899 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71faf475/47481fb95ba64774bffe980536e2850a/FLAGeb433b7f4 [2023-01-28 00:45:04,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71faf475/47481fb95ba64774bffe980536e2850a [2023-01-28 00:45:04,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:45:04,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:45:04,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:04,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:45:04,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:45:04,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:04" (1/1) ... [2023-01-28 00:45:04,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8eabf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:04, skipping insertion in model container [2023-01-28 00:45:04,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:45:04" (1/1) ... [2023-01-28 00:45:04,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:45:04,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:45:05,095 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-01-28 00:45:05,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:05,262 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:45:05,272 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2023-01-28 00:45:05,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:45:05,350 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:05,350 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:45:05,355 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:45:05,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05 WrapperNode [2023-01-28 00:45:05,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:45:05,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:05,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:45:05,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:45:05,361 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:45:05" (1/1) ... [2023-01-28 00:45:05,386 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:45:05" (1/1) ... [2023-01-28 00:45:05,414 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-01-28 00:45:05,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:45:05,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:45:05,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:45:05,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:45:05,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:45:05,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:45:05,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:45:05,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:45:05,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (1/1) ... [2023-01-28 00:45:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:45:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:45:05,524 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:45:05,539 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:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:45:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:45:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:45:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:45:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:45:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:45:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:45:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:45:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:45:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:45:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:45:05,562 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:45:05,666 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:45:05,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:45:05,930 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:45:06,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:45:06,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:45:06,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:06 BoogieIcfgContainer [2023-01-28 00:45:06,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:45:06,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:45:06,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:45:06,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:45:06,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:45:04" (1/3) ... [2023-01-28 00:45:06,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b028c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:06, skipping insertion in model container [2023-01-28 00:45:06,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:45:05" (2/3) ... [2023-01-28 00:45:06,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b028c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:45:06, skipping insertion in model container [2023-01-28 00:45:06,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:45:06" (3/3) ... [2023-01-28 00:45:06,044 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-01-28 00:45:06,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:45:06,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:45:06,057 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:45:06,098 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:45:06,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-28 00:45:06,169 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-28 00:45:06,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:06,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:45:06,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-28 00:45:06,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-28 00:45:06,180 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:45:06,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-28 00:45:06,190 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-28 00:45:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-28 00:45:06,205 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-28 00:45:06,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:06,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:45:06,207 INFO L119 LiptonReduction]: Number of co-enabled transitions 1800 [2023-01-28 00:45:08,747 INFO L134 LiptonReduction]: Checked pairs total: 4706 [2023-01-28 00:45:08,747 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-28 00:45:08,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:45:08,767 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;@6923ab75, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:45:08,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 00:45:08,770 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 00:45:08,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:45:08,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:08,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 00:45:08,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:08,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash 478086440, now seen corresponding path program 1 times [2023-01-28 00:45:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983574370] [2023-01-28 00:45:08,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:09,121 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:45:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983574370] [2023-01-28 00:45:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983574370] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:45:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418848251] [2023-01-28 00:45:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:09,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:45:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:45:09,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:45:09,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-01-28 00:45:09,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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:45:09,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:09,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-01-28 00:45:09,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:09,330 INFO L130 PetriNetUnfolder]: 909/1446 cut-off events. [2023-01-28 00:45:09,330 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 00:45:09,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1446 events. 909/1446 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6812 event pairs, 117 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2848. Up to 1145 conditions per place. [2023-01-28 00:45:09,338 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 28 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-01-28 00:45:09,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 142 flow [2023-01-28 00:45:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:45:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:45:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-01-28 00:45:09,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179738562091504 [2023-01-28 00:45:09,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-01-28 00:45:09,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-01-28 00:45:09,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:09,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-01-28 00:45:09,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:09,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:09,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:09,357 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 317 transitions. [2023-01-28 00:45:09,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 142 flow [2023-01-28 00:45:09,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:09,360 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-28 00:45:09,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-28 00:45:09,363 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 00:45:09,363 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-28 00:45:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have 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:45:09,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:09,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:09,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:45:09,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:09,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 284150693, now seen corresponding path program 1 times [2023-01-28 00:45:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:09,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568616331] [2023-01-28 00:45:09,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:09,641 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:45:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568616331] [2023-01-28 00:45:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568616331] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:45:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358135940] [2023-01-28 00:45:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:09,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:45:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:45:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:45:09,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-01-28 00:45:09,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:45:09,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:09,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-01-28 00:45:09,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:09,851 INFO L130 PetriNetUnfolder]: 861/1294 cut-off events. [2023-01-28 00:45:09,851 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-01-28 00:45:09,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 1294 events. 861/1294 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5307 event pairs, 245 based on Foata normal form. 8/1302 useless extension candidates. Maximal degree in co-relation 2708. Up to 1239 conditions per place. [2023-01-28 00:45:09,858 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-01-28 00:45:09,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 144 flow [2023-01-28 00:45:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:45:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:45:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-01-28 00:45:09,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-01-28 00:45:09,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-01-28 00:45:09,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-01-28 00:45:09,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:09,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-01-28 00:45:09,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have 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:45:09,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:09,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:09,866 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 297 transitions. [2023-01-28 00:45:09,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 144 flow [2023-01-28 00:45:09,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:09,868 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2023-01-28 00:45:09,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-01-28 00:45:09,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 00:45:09,869 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2023-01-28 00:45:09,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:45:09,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:09,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:09,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:45:09,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:09,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 218735648, now seen corresponding path program 1 times [2023-01-28 00:45:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491847634] [2023-01-28 00:45:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491847634] [2023-01-28 00:45:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491847634] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:45:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235629603] [2023-01-28 00:45:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:10,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:10,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-01-28 00:45:10,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:10,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-01-28 00:45:10,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:10,234 INFO L130 PetriNetUnfolder]: 1039/1560 cut-off events. [2023-01-28 00:45:10,234 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2023-01-28 00:45:10,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 1560 events. 1039/1560 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6533 event pairs, 75 based on Foata normal form. 24/1584 useless extension candidates. Maximal degree in co-relation 3488. Up to 977 conditions per place. [2023-01-28 00:45:10,241 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 45 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2023-01-28 00:45:10,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 273 flow [2023-01-28 00:45:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 488 transitions. [2023-01-28 00:45:10,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47843137254901963 [2023-01-28 00:45:10,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 488 transitions. [2023-01-28 00:45:10,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 488 transitions. [2023-01-28 00:45:10,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:10,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 488 transitions. [2023-01-28 00:45:10,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have 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:45:10,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,246 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 5 states and 488 transitions. [2023-01-28 00:45:10,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 273 flow [2023-01-28 00:45:10,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:45:10,247 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 157 flow [2023-01-28 00:45:10,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-01-28 00:45:10,247 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-01-28 00:45:10,248 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 157 flow [2023-01-28 00:45:10,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:10,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:10,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:45:10,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:10,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1602203946, now seen corresponding path program 1 times [2023-01-28 00:45:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169639504] [2023-01-28 00:45:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:10,412 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:45:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169639504] [2023-01-28 00:45:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169639504] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698746537] [2023-01-28 00:45:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:10,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:10,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:10,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-01-28 00:45:10,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 157 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:45:10,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:10,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-01-28 00:45:10,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:10,615 INFO L130 PetriNetUnfolder]: 1191/1808 cut-off events. [2023-01-28 00:45:10,615 INFO L131 PetriNetUnfolder]: For 1799/1799 co-relation queries the response was YES. [2023-01-28 00:45:10,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5147 conditions, 1808 events. 1191/1808 cut-off events. For 1799/1799 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7747 event pairs, 195 based on Foata normal form. 80/1888 useless extension candidates. Maximal degree in co-relation 5132. Up to 771 conditions per place. [2023-01-28 00:45:10,621 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 33 selfloop transitions, 5 changer transitions 14/52 dead transitions. [2023-01-28 00:45:10,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 329 flow [2023-01-28 00:45:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-01-28 00:45:10,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742647058823529 [2023-01-28 00:45:10,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-01-28 00:45:10,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-01-28 00:45:10,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:10,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-01-28 00:45:10,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:45:10,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,629 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,629 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 157 flow. Second operand 4 states and 387 transitions. [2023-01-28 00:45:10,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 329 flow [2023-01-28 00:45:10,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:45:10,632 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 123 flow [2023-01-28 00:45:10,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-01-28 00:45:10,633 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-01-28 00:45:10,633 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 123 flow [2023-01-28 00:45:10,634 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:45:10,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:10,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:10,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:45:10,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:10,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:10,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1809129786, now seen corresponding path program 1 times [2023-01-28 00:45:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725734252] [2023-01-28 00:45:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:10,789 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:45:10,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725734252] [2023-01-28 00:45:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725734252] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:45:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995264954] [2023-01-28 00:45:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:10,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-01-28 00:45:10,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:10,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-01-28 00:45:10,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:10,897 INFO L130 PetriNetUnfolder]: 527/812 cut-off events. [2023-01-28 00:45:10,898 INFO L131 PetriNetUnfolder]: For 1393/1393 co-relation queries the response was YES. [2023-01-28 00:45:10,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 812 events. 527/812 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2917 event pairs, 379 based on Foata normal form. 18/830 useless extension candidates. Maximal degree in co-relation 2436. Up to 604 conditions per place. [2023-01-28 00:45:10,901 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-01-28 00:45:10,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 209 flow [2023-01-28 00:45:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:45:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:45:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-01-28 00:45:10,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820261437908497 [2023-01-28 00:45:10,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-01-28 00:45:10,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-01-28 00:45:10,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:10,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-01-28 00:45:10,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have 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:45:10,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,904 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 123 flow. Second operand 3 states and 295 transitions. [2023-01-28 00:45:10,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 209 flow [2023-01-28 00:45:10,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 192 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-01-28 00:45:10,906 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 120 flow [2023-01-28 00:45:10,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-01-28 00:45:10,907 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-01-28 00:45:10,907 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 120 flow [2023-01-28 00:45:10,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:10,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:10,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:10,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:45:10,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:10,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1252845286, now seen corresponding path program 1 times [2023-01-28 00:45:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129004654] [2023-01-28 00:45:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:11,148 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:45:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129004654] [2023-01-28 00:45:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129004654] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87388476] [2023-01-28 00:45:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:11,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:11,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-01-28 00:45:11,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:45:11,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:11,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-01-28 00:45:11,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:11,259 INFO L130 PetriNetUnfolder]: 369/624 cut-off events. [2023-01-28 00:45:11,260 INFO L131 PetriNetUnfolder]: For 842/868 co-relation queries the response was YES. [2023-01-28 00:45:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 624 events. 369/624 cut-off events. For 842/868 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2652 event pairs, 84 based on Foata normal form. 67/677 useless extension candidates. Maximal degree in co-relation 1867. Up to 268 conditions per place. [2023-01-28 00:45:11,262 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 44 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-01-28 00:45:11,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 336 flow [2023-01-28 00:45:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-01-28 00:45:11,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-01-28 00:45:11,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-01-28 00:45:11,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-01-28 00:45:11,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:11,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-01-28 00:45:11,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have 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:45:11,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,265 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 120 flow. Second operand 4 states and 396 transitions. [2023-01-28 00:45:11,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 336 flow [2023-01-28 00:45:11,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:45:11,267 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 146 flow [2023-01-28 00:45:11,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-01-28 00:45:11,268 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-28 00:45:11,268 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 146 flow [2023-01-28 00:45:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:45:11,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:11,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:45:11,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:11,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1274799269, now seen corresponding path program 1 times [2023-01-28 00:45:11,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:11,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375711033] [2023-01-28 00:45:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:11,470 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:45:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375711033] [2023-01-28 00:45:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375711033] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:45:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709347468] [2023-01-28 00:45:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:11,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:45:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:11,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:45:11,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:45:11,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-01-28 00:45:11,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have 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:45:11,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:11,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-01-28 00:45:11,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:11,580 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2023-01-28 00:45:11,581 INFO L131 PetriNetUnfolder]: For 422/432 co-relation queries the response was YES. [2023-01-28 00:45:11,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 326 events. 173/326 cut-off events. For 422/432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1230 event pairs, 30 based on Foata normal form. 39/359 useless extension candidates. Maximal degree in co-relation 1148. Up to 133 conditions per place. [2023-01-28 00:45:11,582 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 47 selfloop transitions, 8 changer transitions 1/57 dead transitions. [2023-01-28 00:45:11,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 389 flow [2023-01-28 00:45:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:45:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:45:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-28 00:45:11,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2023-01-28 00:45:11,584 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-28 00:45:11,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-28 00:45:11,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:11,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-28 00:45:11,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have 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:45:11,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,586 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,586 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 146 flow. Second operand 5 states and 492 transitions. [2023-01-28 00:45:11,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 389 flow [2023-01-28 00:45:11,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 373 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:11,588 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 181 flow [2023-01-28 00:45:11,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-01-28 00:45:11,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-28 00:45:11,589 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 181 flow [2023-01-28 00:45:11,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have 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:45:11,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:11,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:11,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:45:11,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:11,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1131012184, now seen corresponding path program 1 times [2023-01-28 00:45:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573674772] [2023-01-28 00:45:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:45:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:11,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573674772] [2023-01-28 00:45:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573674772] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:45:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765261970] [2023-01-28 00:45:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:11,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:45:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:11,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:45:11,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:45:11,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 204 [2023-01-28 00:45:11,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:11,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 204 [2023-01-28 00:45:11,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:11,915 INFO L130 PetriNetUnfolder]: 185/363 cut-off events. [2023-01-28 00:45:11,915 INFO L131 PetriNetUnfolder]: For 745/745 co-relation queries the response was YES. [2023-01-28 00:45:11,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 363 events. 185/363 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 51 based on Foata normal form. 7/370 useless extension candidates. Maximal degree in co-relation 1410. Up to 210 conditions per place. [2023-01-28 00:45:11,919 INFO L137 encePairwiseOnDemand]: 201/204 looper letters, 33 selfloop transitions, 3 changer transitions 13/49 dead transitions. [2023-01-28 00:45:11,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 392 flow [2023-01-28 00:45:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:45:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:45:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-01-28 00:45:11,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2023-01-28 00:45:11,920 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-01-28 00:45:11,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-01-28 00:45:11,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:11,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-01-28 00:45:11,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have 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:45:11,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,922 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,922 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 181 flow. Second operand 4 states and 391 transitions. [2023-01-28 00:45:11,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 392 flow [2023-01-28 00:45:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 345 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-01-28 00:45:11,925 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 177 flow [2023-01-28 00:45:11,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-01-28 00:45:11,927 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-28 00:45:11,927 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 177 flow [2023-01-28 00:45:11,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:11,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:11,927 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:45:11,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:45:11,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:11,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1081410734, now seen corresponding path program 1 times [2023-01-28 00:45:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377885534] [2023-01-28 00:45:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:12,272 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:45:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377885534] [2023-01-28 00:45:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377885534] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:45:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570591875] [2023-01-28 00:45:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:12,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:45:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:45:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:45:12,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-01-28 00:45:12,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have 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:45:12,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:12,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-01-28 00:45:12,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:12,381 INFO L130 PetriNetUnfolder]: 145/290 cut-off events. [2023-01-28 00:45:12,381 INFO L131 PetriNetUnfolder]: For 337/344 co-relation queries the response was YES. [2023-01-28 00:45:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 290 events. 145/290 cut-off events. For 337/344 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1128 event pairs, 37 based on Foata normal form. 19/304 useless extension candidates. Maximal degree in co-relation 979. Up to 102 conditions per place. [2023-01-28 00:45:12,382 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 25 selfloop transitions, 11 changer transitions 12/49 dead transitions. [2023-01-28 00:45:12,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 350 flow [2023-01-28 00:45:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:45:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:45:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-01-28 00:45:12,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665032679738562 [2023-01-28 00:45:12,384 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-01-28 00:45:12,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-01-28 00:45:12,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:12,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-01-28 00:45:12,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have 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:45:12,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:12,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:12,387 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 177 flow. Second operand 6 states and 571 transitions. [2023-01-28 00:45:12,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 350 flow [2023-01-28 00:45:12,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 322 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 00:45:12,389 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 156 flow [2023-01-28 00:45:12,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2023-01-28 00:45:12,390 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-01-28 00:45:12,390 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 156 flow [2023-01-28 00:45:12,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have 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:45:12,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:12,390 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] [2023-01-28 00:45:12,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:45:12,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:12,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1624150509, now seen corresponding path program 1 times [2023-01-28 00:45:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841912722] [2023-01-28 00:45:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:45:13,534 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:45:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:45:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841912722] [2023-01-28 00:45:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841912722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:45:13,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:45:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:45:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890358717] [2023-01-28 00:45:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:45:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:45:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:45:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:45:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:45:13,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 204 [2023-01-28 00:45:13,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:45:13,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:45:13,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 204 [2023-01-28 00:45:13,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:45:13,745 INFO L130 PetriNetUnfolder]: 64/150 cut-off events. [2023-01-28 00:45:13,745 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2023-01-28 00:45:13,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 150 events. 64/150 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 489 event pairs, 10 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 563. Up to 65 conditions per place. [2023-01-28 00:45:13,746 INFO L137 encePairwiseOnDemand]: 197/204 looper letters, 29 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-01-28 00:45:13,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 418 flow [2023-01-28 00:45:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 00:45:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 00:45:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 686 transitions. [2023-01-28 00:45:13,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42034313725490197 [2023-01-28 00:45:13,748 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 686 transitions. [2023-01-28 00:45:13,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 686 transitions. [2023-01-28 00:45:13,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:45:13,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 686 transitions. [2023-01-28 00:45:13,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 85.75) internal successors, (686), 8 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have 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:45:13,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:13,751 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:45:13,751 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 156 flow. Second operand 8 states and 686 transitions. [2023-01-28 00:45:13,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 418 flow [2023-01-28 00:45:13,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 273 flow, removed 28 selfloop flow, removed 12 redundant places. [2023-01-28 00:45:13,753 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 102 flow [2023-01-28 00:45:13,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-01-28 00:45:13,753 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2023-01-28 00:45:13,753 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 102 flow [2023-01-28 00:45:13,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.375) internal successors, (667), 8 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:45:13,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:45:13,754 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] [2023-01-28 00:45:13,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:45:13,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 00:45:13,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:45:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1566932833, now seen corresponding path program 2 times [2023-01-28 00:45:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:45:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490495681] [2023-01-28 00:45:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:45:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:45:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:13,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:45:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:45:13,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:45:13,856 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:45:13,857 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 00:45:13,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 00:45:13,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 00:45:13,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 00:45:13,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 00:45:13,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 00:45:13,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:45:13,859 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:45:13,863 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:45:13,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:45:13,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:45:13 BasicIcfg [2023-01-28 00:45:13,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:45:13,918 INFO L158 Benchmark]: Toolchain (without parser) took 9003.40ms. Allocated memory was 427.8MB in the beginning and 658.5MB in the end (delta: 230.7MB). Free memory was 386.7MB in the beginning and 499.8MB in the end (delta: -113.1MB). Peak memory consumption was 118.0MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,918 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 318.8MB. Free memory is still 268.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:45:13,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.77ms. Allocated memory is still 427.8MB. Free memory was 386.3MB in the beginning and 362.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.84ms. Allocated memory is still 427.8MB. Free memory was 362.5MB in the beginning and 359.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,918 INFO L158 Benchmark]: Boogie Preprocessor took 37.75ms. Allocated memory is still 427.8MB. Free memory was 359.8MB in the beginning and 357.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,918 INFO L158 Benchmark]: RCFGBuilder took 585.68ms. Allocated memory is still 427.8MB. Free memory was 357.7MB in the beginning and 389.7MB in the end (delta: -32.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,919 INFO L158 Benchmark]: TraceAbstraction took 7877.35ms. Allocated memory was 427.8MB in the beginning and 658.5MB in the end (delta: 230.7MB). Free memory was 388.6MB in the beginning and 499.8MB in the end (delta: -111.1MB). Peak memory consumption was 119.5MB. Max. memory is 16.0GB. [2023-01-28 00:45:13,920 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.48ms. Allocated memory is still 318.8MB. Free memory is still 268.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 440.77ms. Allocated memory is still 427.8MB. Free memory was 386.3MB in the beginning and 362.5MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.84ms. Allocated memory is still 427.8MB. Free memory was 362.5MB in the beginning and 359.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.75ms. Allocated memory is still 427.8MB. Free memory was 359.8MB in the beginning and 357.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 585.68ms. Allocated memory is still 427.8MB. Free memory was 357.7MB in the beginning and 389.7MB in the end (delta: -32.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.0GB. * TraceAbstraction took 7877.35ms. Allocated memory was 427.8MB in the beginning and 658.5MB in the end (delta: 230.7MB). Free memory was 388.6MB in the beginning and 499.8MB in the end (delta: -111.1MB). Peak memory consumption was 119.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 113 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1800 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 4706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2318, independent: 2149, independent conditional: 0, independent unconditional: 2149, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1005, independent: 971, independent conditional: 0, independent unconditional: 971, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2318, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1005, unknown conditional: 0, unknown unconditional: 1005] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-3, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-2, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L864] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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: 845]: 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: 849]: 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: 847]: 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: 7.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 601 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 3 mSDtfsCounter, 601 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:45:13,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...