/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:03:13,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:03:13,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:03:13,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:03:13,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:03:13,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:03:13,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:03:13,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:03:13,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:03:13,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:03:13,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:03:13,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:03:13,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:03:13,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:03:13,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:03:13,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:03:13,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:03:13,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:03:13,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:03:13,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:03:13,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:03:13,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:03:13,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:03:13,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:03:13,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:03:13,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:03:13,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:03:13,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:03:13,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:03:13,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:03:13,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:03:13,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:03:13,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:03:13,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:03:13,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:03:13,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:03:13,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:03:13,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:03:13,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:03:13,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:03:13,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:03:13,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 07:03:13,246 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:03:13,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:03:13,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:03:13,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:03:13,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:03:13,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:03:13,251 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:03:13,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:03:13,251 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:03:13,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:03:13,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:03:13,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:03:13,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:03:13,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:03:13,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:03:13,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:03:13,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:13,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:03:13,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:03:13,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:03:13,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:03:13,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:03:13,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:03:13,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:03:13,256 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:03:13,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:03:13,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:03:13,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:03:13,479 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:03:13,482 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:03:13,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:03:14,548 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:03:14,830 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:03:14,830 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:03:14,850 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38398d3ff/c7133ba969a54b12a745c10e0593dee8/FLAG89ee5967a [2023-01-28 07:03:14,861 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38398d3ff/c7133ba969a54b12a745c10e0593dee8 [2023-01-28 07:03:14,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:03:14,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:03:14,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:14,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:03:14,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:03:14,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:14" (1/1) ... [2023-01-28 07:03:14,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163e9fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:14, skipping insertion in model container [2023-01-28 07:03:14,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:14" (1/1) ... [2023-01-28 07:03:14,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:03:14,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:03:15,046 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 07:03:15,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:15,285 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:03:15,297 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-28 07:03:15,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:15,408 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:15,408 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:15,414 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:03:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15 WrapperNode [2023-01-28 07:03:15,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:15,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:15,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:03:15,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:03:15,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,486 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-01-28 07:03:15,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:15,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:03:15,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:03:15,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:03:15,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,508 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:03:15,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:03:15,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:03:15,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:03:15,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (1/1) ... [2023-01-28 07:03:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:03:15,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 07:03:15,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 07:03:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:03:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:03:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:03:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:03:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:03:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:03:15,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:03:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:03:15,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:03:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 07:03:15,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 07:03:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:03:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:03:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:03:15,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:03:15,593 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:03:15,708 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:03:15,710 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:03:15,998 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:03:16,106 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:03:16,106 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:03:16,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:16 BoogieIcfgContainer [2023-01-28 07:03:16,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:03:16,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:03:16,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:03:16,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:03:16,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:03:14" (1/3) ... [2023-01-28 07:03:16,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67221138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:16, skipping insertion in model container [2023-01-28 07:03:16,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:15" (2/3) ... [2023-01-28 07:03:16,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67221138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:16, skipping insertion in model container [2023-01-28 07:03:16,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:16" (3/3) ... [2023-01-28 07:03:16,123 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-28 07:03:16,138 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:03:16,139 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:03:16,139 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:03:16,208 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:03:16,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-01-28 07:03:16,292 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-28 07:03:16,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:16,298 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 55 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 07:03:16,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-01-28 07:03:16,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-01-28 07:03:16,305 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:03:16,320 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-28 07:03:16,322 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-01-28 07:03:16,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-01-28 07:03:16,346 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2023-01-28 07:03:16,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:16,347 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 55 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 07:03:16,367 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-28 07:03:19,818 INFO L134 LiptonReduction]: Checked pairs total: 4600 [2023-01-28 07:03:19,818 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-28 07:03:19,832 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:03:19,838 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;@4efdee7a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:03:19,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 07:03:19,842 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 07:03:19,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:19,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:19,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 07:03:19,844 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 07:03:19,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 443787265, now seen corresponding path program 1 times [2023-01-28 07:03:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099740687] [2023-01-28 07:03:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099740687] [2023-01-28 07:03:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099740687] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:03:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27884725] [2023-01-28 07:03:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:03:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:03:20,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:03:20,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 202 [2023-01-28 07:03:20,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:20,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 202 [2023-01-28 07:03:20,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:20,511 INFO L130 PetriNetUnfolder]: 711/1164 cut-off events. [2023-01-28 07:03:20,511 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 07:03:20,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1164 events. 711/1164 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5717 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2272. Up to 859 conditions per place. [2023-01-28 07:03:20,525 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-01-28 07:03:20,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-01-28 07:03:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:03:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:03:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-01-28 07:03:20,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5264026402640264 [2023-01-28 07:03:20,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-01-28 07:03:20,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-01-28 07:03:20,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:20,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-01-28 07:03:20,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,561 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 319 transitions. [2023-01-28 07:03:20,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-01-28 07:03:20,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:20,567 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-28 07:03:20,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=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 07:03:20,571 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 07:03:20,572 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-28 07:03:20,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:20,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:20,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:03:20,573 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 07:03:20,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash -346994569, now seen corresponding path program 1 times [2023-01-28 07:03:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019317978] [2023-01-28 07:03:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:20,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019317978] [2023-01-28 07:03:20,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019317978] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:03:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840952072] [2023-01-28 07:03:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:20,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:03:20,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:03:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:03:20,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 202 [2023-01-28 07:03:20,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:20,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:20,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 202 [2023-01-28 07:03:20,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:21,103 INFO L130 PetriNetUnfolder]: 689/1044 cut-off events. [2023-01-28 07:03:21,103 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2023-01-28 07:03:21,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1044 events. 689/1044 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4309 event pairs, 169 based on Foata normal form. 8/1050 useless extension candidates. Maximal degree in co-relation 2208. Up to 953 conditions per place. [2023-01-28 07:03:21,109 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2023-01-28 07:03:21,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 142 flow [2023-01-28 07:03:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:03:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:03:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-01-28 07:03:21,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49834983498349833 [2023-01-28 07:03:21,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-01-28 07:03:21,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-01-28 07:03:21,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:21,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-01-28 07:03:21,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,117 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 302 transitions. [2023-01-28 07:03:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 142 flow [2023-01-28 07:03:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:21,119 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2023-01-28 07:03:21,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, 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 07:03:21,120 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-28 07:03:21,120 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2023-01-28 07:03:21,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:21,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:21,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:03:21,121 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 07:03:21,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2128069186, now seen corresponding path program 1 times [2023-01-28 07:03:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596674564] [2023-01-28 07:03:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:21,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596674564] [2023-01-28 07:03:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596674564] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:03:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91347311] [2023-01-28 07:03:21,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:21,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:03:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:03:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:03:21,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-01-28 07:03:21,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 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 07:03:21,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:21,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-01-28 07:03:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:21,573 INFO L130 PetriNetUnfolder]: 805/1290 cut-off events. [2023-01-28 07:03:21,574 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2023-01-28 07:03:21,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 1290 events. 805/1290 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5970 event pairs, 193 based on Foata normal form. 70/1356 useless extension candidates. Maximal degree in co-relation 2833. Up to 486 conditions per place. [2023-01-28 07:03:21,579 INFO L137 encePairwiseOnDemand]: 198/202 looper letters, 30 selfloop transitions, 4 changer transitions 8/43 dead transitions. [2023-01-28 07:03:21,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 205 flow [2023-01-28 07:03:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:03:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:03:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2023-01-28 07:03:21,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 07:03:21,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 404 transitions. [2023-01-28 07:03:21,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 404 transitions. [2023-01-28 07:03:21,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:21,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 404 transitions. [2023-01-28 07:03:21,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,585 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 4 states and 404 transitions. [2023-01-28 07:03:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 205 flow [2023-01-28 07:03:21,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 07:03:21,586 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 79 flow [2023-01-28 07:03:21,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-01-28 07:03:21,588 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-01-28 07:03:21,590 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 79 flow [2023-01-28 07:03:21,591 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 07:03:21,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:21,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:21,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:03:21,592 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 07:03:21,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1939911203, now seen corresponding path program 1 times [2023-01-28 07:03:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193722385] [2023-01-28 07:03:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:21,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193722385] [2023-01-28 07:03:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193722385] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785237691] [2023-01-28 07:03:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:21,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:03:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:21,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:03:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:03:21,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-01-28 07:03:21,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:21,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-01-28 07:03:21,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:21,959 INFO L130 PetriNetUnfolder]: 335/575 cut-off events. [2023-01-28 07:03:21,959 INFO L131 PetriNetUnfolder]: For 237/238 co-relation queries the response was YES. [2023-01-28 07:03:21,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 575 events. 335/575 cut-off events. For 237/238 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2379 event pairs, 73 based on Foata normal form. 53/624 useless extension candidates. Maximal degree in co-relation 1416. Up to 343 conditions per place. [2023-01-28 07:03:21,962 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 31 selfloop transitions, 4 changer transitions 23/60 dead transitions. [2023-01-28 07:03:21,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 317 flow [2023-01-28 07:03:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:03:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:03:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-01-28 07:03:21,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48217821782178216 [2023-01-28 07:03:21,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-01-28 07:03:21,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-01-28 07:03:21,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:21,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-01-28 07:03:21,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,968 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 79 flow. Second operand 5 states and 487 transitions. [2023-01-28 07:03:21,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 317 flow [2023-01-28 07:03:21,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:21,970 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 110 flow [2023-01-28 07:03:21,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-01-28 07:03:21,971 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-01-28 07:03:21,971 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 110 flow [2023-01-28 07:03:21,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:21,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:21,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:21,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:03:21,972 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 07:03:21,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1267308360, now seen corresponding path program 1 times [2023-01-28 07:03:21,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:21,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150851896] [2023-01-28 07:03:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150851896] [2023-01-28 07:03:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150851896] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:03:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204282015] [2023-01-28 07:03:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:22,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-01-28 07:03:22,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:22,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-01-28 07:03:22,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:22,325 INFO L130 PetriNetUnfolder]: 179/338 cut-off events. [2023-01-28 07:03:22,325 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2023-01-28 07:03:22,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 338 events. 179/338 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1262 event pairs, 45 based on Foata normal form. 31/365 useless extension candidates. Maximal degree in co-relation 1028. Up to 119 conditions per place. [2023-01-28 07:03:22,328 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 38 selfloop transitions, 7 changer transitions 20/67 dead transitions. [2023-01-28 07:03:22,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 404 flow [2023-01-28 07:03:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:03:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:03:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-01-28 07:03:22,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48102310231023104 [2023-01-28 07:03:22,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-01-28 07:03:22,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-01-28 07:03:22,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:22,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-01-28 07:03:22,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,335 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,335 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 110 flow. Second operand 6 states and 583 transitions. [2023-01-28 07:03:22,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 404 flow [2023-01-28 07:03:22,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 394 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:22,340 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 156 flow [2023-01-28 07:03:22,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-01-28 07:03:22,342 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-01-28 07:03:22,343 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 156 flow [2023-01-28 07:03:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:22,343 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 07:03:22,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:03:22,343 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 07:03:22,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1416484773, now seen corresponding path program 1 times [2023-01-28 07:03:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409418811] [2023-01-28 07:03:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:22,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:22,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409418811] [2023-01-28 07:03:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409418811] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:22,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:22,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:03:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652644560] [2023-01-28 07:03:22,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:22,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:03:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:03:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:03:22,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 202 [2023-01-28 07:03:22,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:22,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 202 [2023-01-28 07:03:22,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:22,751 INFO L130 PetriNetUnfolder]: 121/235 cut-off events. [2023-01-28 07:03:22,751 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2023-01-28 07:03:22,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 235 events. 121/235 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 798 event pairs, 42 based on Foata normal form. 9/240 useless extension candidates. Maximal degree in co-relation 749. Up to 92 conditions per place. [2023-01-28 07:03:22,753 INFO L137 encePairwiseOnDemand]: 196/202 looper letters, 35 selfloop transitions, 10 changer transitions 9/56 dead transitions. [2023-01-28 07:03:22,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 378 flow [2023-01-28 07:03:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:03:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:03:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2023-01-28 07:03:22,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46746817538896746 [2023-01-28 07:03:22,756 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2023-01-28 07:03:22,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2023-01-28 07:03:22,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:22,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2023-01-28 07:03:22,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,760 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,760 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 156 flow. Second operand 7 states and 661 transitions. [2023-01-28 07:03:22,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 378 flow [2023-01-28 07:03:22,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 331 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-01-28 07:03:22,765 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 151 flow [2023-01-28 07:03:22,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-01-28 07:03:22,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-28 07:03:22,767 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 151 flow [2023-01-28 07:03:22,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.66666666666667) internal successors, (538), 6 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:22,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:22,768 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 07:03:22,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:03:22,768 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 07:03:22,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 823098516, now seen corresponding path program 1 times [2023-01-28 07:03:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:22,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534670035] [2023-01-28 07:03:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:23,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534670035] [2023-01-28 07:03:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534670035] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:23,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605272765] [2023-01-28 07:03:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:23,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:03:23,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:23,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:03:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:03:23,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 202 [2023-01-28 07:03:23,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:23,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 202 [2023-01-28 07:03:23,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:23,147 INFO L130 PetriNetUnfolder]: 158/296 cut-off events. [2023-01-28 07:03:23,147 INFO L131 PetriNetUnfolder]: For 425/425 co-relation queries the response was YES. [2023-01-28 07:03:23,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 296 events. 158/296 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1096 event pairs, 16 based on Foata normal form. 1/296 useless extension candidates. Maximal degree in co-relation 944. Up to 189 conditions per place. [2023-01-28 07:03:23,149 INFO L137 encePairwiseOnDemand]: 199/202 looper letters, 30 selfloop transitions, 1 changer transitions 23/55 dead transitions. [2023-01-28 07:03:23,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 416 flow [2023-01-28 07:03:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:03:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:03:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2023-01-28 07:03:23,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49876237623762376 [2023-01-28 07:03:23,151 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2023-01-28 07:03:23,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2023-01-28 07:03:23,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:23,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2023-01-28 07:03:23,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,154 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,154 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 151 flow. Second operand 4 states and 403 transitions. [2023-01-28 07:03:23,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 416 flow [2023-01-28 07:03:23,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 336 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-01-28 07:03:23,156 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 111 flow [2023-01-28 07:03:23,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-01-28 07:03:23,157 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-01-28 07:03:23,157 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 111 flow [2023-01-28 07:03:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:23,157 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 07:03:23,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:03:23,158 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 07:03:23,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 294128058, now seen corresponding path program 2 times [2023-01-28 07:03:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479962047] [2023-01-28 07:03:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 07:03:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479962047] [2023-01-28 07:03:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479962047] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:03:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630617850] [2023-01-28 07:03:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:03:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:03:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:03:23,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-01-28 07:03:23,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:23,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:23,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-01-28 07:03:23,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:24,135 INFO L130 PetriNetUnfolder]: 84/186 cut-off events. [2023-01-28 07:03:24,135 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2023-01-28 07:03:24,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 186 events. 84/186 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 610 event pairs, 9 based on Foata normal form. 1/186 useless extension candidates. Maximal degree in co-relation 568. Up to 95 conditions per place. [2023-01-28 07:03:24,136 INFO L137 encePairwiseOnDemand]: 197/202 looper letters, 28 selfloop transitions, 3 changer transitions 18/51 dead transitions. [2023-01-28 07:03:24,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 326 flow [2023-01-28 07:03:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:03:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:03:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2023-01-28 07:03:24,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45544554455445546 [2023-01-28 07:03:24,138 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 552 transitions. [2023-01-28 07:03:24,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 552 transitions. [2023-01-28 07:03:24,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:24,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 552 transitions. [2023-01-28 07:03:24,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:24,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:24,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:24,142 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 111 flow. Second operand 6 states and 552 transitions. [2023-01-28 07:03:24,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 326 flow [2023-01-28 07:03:24,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 318 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:24,144 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 117 flow [2023-01-28 07:03:24,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-01-28 07:03:24,146 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-28 07:03:24,146 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 117 flow [2023-01-28 07:03:24,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:24,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:24,147 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 07:03:24,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:03:24,147 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 07:03:24,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 896977610, now seen corresponding path program 3 times [2023-01-28 07:03:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:24,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319153546] [2023-01-28 07:03:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:03:24,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:03:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:03:24,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:03:24,264 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:03:24,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 07:03:24,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 07:03:24,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 07:03:24,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 07:03:24,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 07:03:24,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 07:03:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:03:24,267 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:24,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:03:24,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:03:24,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:03:24 BasicIcfg [2023-01-28 07:03:24,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:03:24,346 INFO L158 Benchmark]: Toolchain (without parser) took 9481.34ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 280.6MB in the beginning and 320.7MB in the end (delta: -40.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,346 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 255.9MB. Free memory is still 214.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:03:24,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.08ms. Allocated memory is still 331.4MB. Free memory was 280.3MB in the beginning and 301.2MB in the end (delta: -20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.75ms. Allocated memory is still 331.4MB. Free memory was 301.2MB in the beginning and 298.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,347 INFO L158 Benchmark]: Boogie Preprocessor took 25.07ms. Allocated memory is still 331.4MB. Free memory was 298.8MB in the beginning and 296.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,347 INFO L158 Benchmark]: RCFGBuilder took 595.20ms. Allocated memory is still 331.4MB. Free memory was 296.9MB in the beginning and 263.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,347 INFO L158 Benchmark]: TraceAbstraction took 8234.94ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 262.5MB in the beginning and 320.7MB in the end (delta: -58.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. [2023-01-28 07:03:24,352 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.17ms. Allocated memory is still 255.9MB. Free memory is still 214.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.08ms. Allocated memory is still 331.4MB. Free memory was 280.3MB in the beginning and 301.2MB in the end (delta: -20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.75ms. Allocated memory is still 331.4MB. Free memory was 301.2MB in the beginning and 298.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.07ms. Allocated memory is still 331.4MB. Free memory was 298.8MB in the beginning and 296.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 595.20ms. Allocated memory is still 331.4MB. Free memory was 296.9MB in the beginning and 263.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 8234.94ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 262.5MB in the beginning and 320.7MB in the end (delta: -58.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 113 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 4600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2305, independent: 2134, independent conditional: 0, independent unconditional: 2134, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1035, independent: 994, independent conditional: 0, independent unconditional: 994, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2305, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1035, unknown conditional: 0, unknown unconditional: 1035] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-3, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-2, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=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: 836]: 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: 838]: 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: 834]: 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: 8.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 567 IncrementalHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 3 mSDtfsCounter, 567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=5, InterpolantAutomatonStates: 38, 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.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 07:03:24,375 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...