/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:26:08,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:26:08,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:26:08,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:26:08,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:26:08,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:26:08,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:26:08,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:26:08,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:26:08,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:26:08,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:26:08,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:26:08,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:26:08,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:26:08,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:26:08,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:26:08,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:26:08,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:26:08,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:26:08,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:26:08,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:26:08,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:26:08,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:26:08,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:26:08,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:26:08,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:26:08,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:26:08,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:26:08,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:26:08,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:26:08,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:26:08,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:26:08,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:26:08,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:26:08,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:26:08,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:26:08,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:26:08,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:26:08,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:26:08,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:26:08,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:26:08,315 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-RepeatedSemanticLbe.epf [2022-12-13 06:26:08,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:26:08,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:26:08,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:26:08,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:26:08,342 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:26:08,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:26:08,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:26:08,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:26:08,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:26:08,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:26:08,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:26:08,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:26:08,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:26:08,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:26:08,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:26:08,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:26:08,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:26:08,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:26:08,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:26:08,589 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:26:08,591 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:26:08,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:26:09,509 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:26:09,774 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:26:09,774 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:26:09,786 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f386568b6/630f51b23fc240b298a83a59825d1855/FLAG8eedfa8fd [2022-12-13 06:26:09,796 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f386568b6/630f51b23fc240b298a83a59825d1855 [2022-12-13 06:26:09,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:26:09,799 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:26:09,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:26:09,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:26:09,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:26:09,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:26:09" (1/1) ... [2022-12-13 06:26:09,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a82ba7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:09, skipping insertion in model container [2022-12-13 06:26:09,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:26:09" (1/1) ... [2022-12-13 06:26:09,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:26:09,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:26:09,996 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 06:26:10,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:26:10,150 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:26:10,163 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 06:26:10,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:26:10,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:26:10,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:26:10,261 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:26:10,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10 WrapperNode [2022-12-13 06:26:10,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:26:10,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:26:10,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:26:10,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:26:10,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,320 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-12-13 06:26:10,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:26:10,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:26:10,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:26:10,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:26:10,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:26:10,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:26:10,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:26:10,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:26:10,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (1/1) ... [2022-12-13 06:26:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:26:10,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:26:10,401 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) [2022-12-13 06:26:10,417 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 [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:26:10,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:26:10,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:26:10,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:26:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:26:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:26:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:26:10,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:26:10,439 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:26:10,568 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:26:10,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:26:10,835 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:26:10,947 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:26:10,947 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:26:10,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:26:10 BoogieIcfgContainer [2022-12-13 06:26:10,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:26:10,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:26:10,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:26:10,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:26:10,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:26:09" (1/3) ... [2022-12-13 06:26:10,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795da554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:26:10, skipping insertion in model container [2022-12-13 06:26:10,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:26:10" (2/3) ... [2022-12-13 06:26:10,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795da554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:26:10, skipping insertion in model container [2022-12-13 06:26:10,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:26:10" (3/3) ... [2022-12-13 06:26:10,958 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 06:26:10,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:26:10,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:26:10,971 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:26:11,014 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:26:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 186 flow [2022-12-13 06:26:11,090 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-13 06:26:11,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:26:11,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 06:26:11,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 88 transitions, 186 flow [2022-12-13 06:26:11,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 178 flow [2022-12-13 06:26:11,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:11,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-13 06:26:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 178 flow [2022-12-13 06:26:11,142 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-13 06:26:11,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:26:11,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 06:26:11,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 178 flow [2022-12-13 06:26:11,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-13 06:26:14,587 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 06:26:14,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:26:14,602 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=REPEATED_LIPTON_PN, 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;@a2b009e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:26:14,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 06:26:14,604 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-13 06:26:14,604 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:26:14,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:14,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:26:14,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 406336, now seen corresponding path program 1 times [2022-12-13 06:26:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144090029] [2022-12-13 06:26:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:14,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144090029] [2022-12-13 06:26:14,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144090029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:14,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:26:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909679755] [2022-12-13 06:26:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:26:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:26:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:26:14,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2022-12-13 06:26:14,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:14,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:14,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2022-12-13 06:26:14,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:15,205 INFO L130 PetriNetUnfolder]: 1122/2148 cut-off events. [2022-12-13 06:26:15,206 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 06:26:15,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 2148 events. 1122/2148 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14779 event pairs, 110 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 3997. Up to 1589 conditions per place. [2022-12-13 06:26:15,214 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 24 selfloop transitions, 2 changer transitions 47/80 dead transitions. [2022-12-13 06:26:15,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 313 flow [2022-12-13 06:26:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:26:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:26:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-13 06:26:15,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2022-12-13 06:26:15,225 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2022-12-13 06:26:15,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 80 transitions, 313 flow [2022-12-13 06:26:15,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 127 flow [2022-12-13 06:26:15,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:15,239 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-13 06:26:15,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:15,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:15,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 06:26:15,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 06:26:15,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 06:26:15,262 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:26:15,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 06:26:15,263 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-13 06:26:15,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:15,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:15,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:26:15,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1623345271, now seen corresponding path program 1 times [2022-12-13 06:26:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:15,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081182768] [2022-12-13 06:26:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:15,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081182768] [2022-12-13 06:26:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081182768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:15,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:15,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:26:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960339850] [2022-12-13 06:26:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:15,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:26:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:26:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:26:15,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2022-12-13 06:26:15,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:15,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2022-12-13 06:26:15,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:15,568 INFO L130 PetriNetUnfolder]: 215/404 cut-off events. [2022-12-13 06:26:15,568 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 06:26:15,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 404 events. 215/404 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1749 event pairs, 24 based on Foata normal form. 5/353 useless extension candidates. Maximal degree in co-relation 1120. Up to 321 conditions per place. [2022-12-13 06:26:15,571 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 31 selfloop transitions, 3 changer transitions 2/42 dead transitions. [2022-12-13 06:26:15,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 233 flow [2022-12-13 06:26:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:26:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:26:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 06:26:15,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 06:26:15,573 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -23 predicate places. [2022-12-13 06:26:15,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 42 transitions, 233 flow [2022-12-13 06:26:15,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 40 transitions, 225 flow [2022-12-13 06:26:15,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:15,577 INFO L89 Accepts]: Start accepts. Operand has 33 places, 40 transitions, 225 flow [2022-12-13 06:26:15,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:15,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:15,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 40 transitions, 225 flow [2022-12-13 06:26:15,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 40 transitions, 225 flow [2022-12-13 06:26:15,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 06:26:15,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:26:15,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:26:15,583 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 40 transitions, 225 flow [2022-12-13 06:26:15,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:15,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:15,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:26:15,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:15,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1215906392, now seen corresponding path program 1 times [2022-12-13 06:26:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:15,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117544144] [2022-12-13 06:26:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117544144] [2022-12-13 06:26:15,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117544144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:15,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:15,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:26:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475158104] [2022-12-13 06:26:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:15,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:26:15,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:26:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:26:15,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 06:26:15,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 40 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:15,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 06:26:15,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:15,800 INFO L130 PetriNetUnfolder]: 217/407 cut-off events. [2022-12-13 06:26:15,800 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 06:26:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 407 events. 217/407 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1665 event pairs, 21 based on Foata normal form. 6/361 useless extension candidates. Maximal degree in co-relation 1497. Up to 317 conditions per place. [2022-12-13 06:26:15,803 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 52 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2022-12-13 06:26:15,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:26:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:26:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 06:26:15,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-13 06:26:15,804 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -20 predicate places. [2022-12-13 06:26:15,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:15,809 INFO L89 Accepts]: Start accepts. Operand has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:15,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:15,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 06:26:15,812 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:26:15,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:26:15,813 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 64 transitions, 486 flow [2022-12-13 06:26:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:15,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:15,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:26:15,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 961604527, now seen corresponding path program 1 times [2022-12-13 06:26:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:15,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810582738] [2022-12-13 06:26:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810582738] [2022-12-13 06:26:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810582738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:26:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301304805] [2022-12-13 06:26:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:26:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:26:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:26:15,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 06:26:15,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 64 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:15,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:15,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 06:26:15,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:16,040 INFO L130 PetriNetUnfolder]: 259/501 cut-off events. [2022-12-13 06:26:16,040 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-13 06:26:16,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 501 events. 259/501 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2319 event pairs, 16 based on Foata normal form. 24/451 useless extension candidates. Maximal degree in co-relation 2303. Up to 410 conditions per place. [2022-12-13 06:26:16,043 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 27 selfloop transitions, 3 changer transitions 36/70 dead transitions. [2022-12-13 06:26:16,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 70 transitions, 664 flow [2022-12-13 06:26:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:26:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:26:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 06:26:16,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2022-12-13 06:26:16,045 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -17 predicate places. [2022-12-13 06:26:16,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 70 transitions, 664 flow [2022-12-13 06:26:16,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 34 transitions, 316 flow [2022-12-13 06:26:16,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:16,051 INFO L89 Accepts]: Start accepts. Operand has 38 places, 34 transitions, 316 flow [2022-12-13 06:26:16,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:16,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:16,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 34 transitions, 316 flow [2022-12-13 06:26:16,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 34 transitions, 316 flow [2022-12-13 06:26:16,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 06:26:16,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:26:16,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 06:26:16,234 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 316 flow [2022-12-13 06:26:16,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:16,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:16,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:16,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:26:16,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash -253490571, now seen corresponding path program 1 times [2022-12-13 06:26:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:16,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988638339] [2022-12-13 06:26:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988638339] [2022-12-13 06:26:16,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988638339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:16,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:16,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:26:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446748590] [2022-12-13 06:26:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:16,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:26:16,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:16,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:26:16,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:26:16,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 06:26:16,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:16,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:16,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 06:26:16,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:16,372 INFO L130 PetriNetUnfolder]: 111/237 cut-off events. [2022-12-13 06:26:16,372 INFO L131 PetriNetUnfolder]: For 276/276 co-relation queries the response was YES. [2022-12-13 06:26:16,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 237 events. 111/237 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 927 event pairs, 16 based on Foata normal form. 10/218 useless extension candidates. Maximal degree in co-relation 1289. Up to 208 conditions per place. [2022-12-13 06:26:16,374 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 30 selfloop transitions, 9 changer transitions 1/42 dead transitions. [2022-12-13 06:26:16,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 461 flow [2022-12-13 06:26:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:26:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:26:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 06:26:16,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 06:26:16,377 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -17 predicate places. [2022-12-13 06:26:16,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 42 transitions, 461 flow [2022-12-13 06:26:16,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 41 transitions, 459 flow [2022-12-13 06:26:16,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:16,382 INFO L89 Accepts]: Start accepts. Operand has 39 places, 41 transitions, 459 flow [2022-12-13 06:26:16,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:16,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:16,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 41 transitions, 459 flow [2022-12-13 06:26:16,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 41 transitions, 459 flow [2022-12-13 06:26:16,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 06:26:16,385 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:26:16,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:26:16,385 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 459 flow [2022-12-13 06:26:16,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:16,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:16,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:26:16,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1375596016, now seen corresponding path program 1 times [2022-12-13 06:26:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:16,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317657329] [2022-12-13 06:26:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317657329] [2022-12-13 06:26:16,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317657329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:16,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:16,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:26:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693917881] [2022-12-13 06:26:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:26:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:26:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:26:16,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-13 06:26:16,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:16,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:16,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-13 06:26:16,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:16,554 INFO L130 PetriNetUnfolder]: 36/107 cut-off events. [2022-12-13 06:26:16,554 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 06:26:16,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 107 events. 36/107 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 342 event pairs, 0 based on Foata normal form. 18/111 useless extension candidates. Maximal degree in co-relation 675. Up to 86 conditions per place. [2022-12-13 06:26:16,556 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 21 selfloop transitions, 15 changer transitions 0/38 dead transitions. [2022-12-13 06:26:16,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:26:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:26:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 06:26:16,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-13 06:26:16,561 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2022-12-13 06:26:16,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:16,563 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:16,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:16,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 495 flow [2022-12-13 06:26:16,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 06:26:16,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:26:16,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-13 06:26:16,806 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 481 flow [2022-12-13 06:26:16,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:16,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:16,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:16,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:26:16,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -900657123, now seen corresponding path program 1 times [2022-12-13 06:26:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:16,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620824721] [2022-12-13 06:26:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:26:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:26:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:26:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620824721] [2022-12-13 06:26:17,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620824721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:26:17,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:26:17,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:26:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70513727] [2022-12-13 06:26:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:26:17,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:26:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:26:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:26:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:26:17,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2022-12-13 06:26:17,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:17,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:26:17,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2022-12-13 06:26:17,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:26:17,203 INFO L130 PetriNetUnfolder]: 47/129 cut-off events. [2022-12-13 06:26:17,204 INFO L131 PetriNetUnfolder]: For 346/346 co-relation queries the response was YES. [2022-12-13 06:26:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 129 events. 47/129 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 472 event pairs, 1 based on Foata normal form. 9/115 useless extension candidates. Maximal degree in co-relation 893. Up to 100 conditions per place. [2022-12-13 06:26:17,204 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 22 selfloop transitions, 2 changer transitions 26/56 dead transitions. [2022-12-13 06:26:17,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 850 flow [2022-12-13 06:26:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:26:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:26:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-13 06:26:17,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2022-12-13 06:26:17,207 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2022-12-13 06:26:17,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 56 transitions, 850 flow [2022-12-13 06:26:17,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 30 transitions, 428 flow [2022-12-13 06:26:17,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:26:17,210 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 428 flow [2022-12-13 06:26:17,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:26:17,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:26:17,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 428 flow [2022-12-13 06:26:17,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 428 flow [2022-12-13 06:26:17,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 06:26:17,506 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:26:17,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 06:26:17,507 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 412 flow [2022-12-13 06:26:17,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:26:17,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:26:17,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:17,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:26:17,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:26:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:26:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash -907007153, now seen corresponding path program 1 times [2022-12-13 06:26:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:26:17,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867026467] [2022-12-13 06:26:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:26:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:26:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:26:17,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:26:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:26:17,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:26:17,579 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:26:17,580 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 06:26:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 06:26:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 06:26:17,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 06:26:17,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 06:26:17,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:26:17,582 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:26:17,585 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:26:17,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:26:17,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:26:17 BasicIcfg [2022-12-13 06:26:17,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:26:17,635 INFO L158 Benchmark]: Toolchain (without parser) took 7836.23ms. Allocated memory was 201.3MB in the beginning and 317.7MB in the end (delta: 116.4MB). Free memory was 177.1MB in the beginning and 193.5MB in the end (delta: -16.5MB). Peak memory consumption was 101.0MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,635 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:26:17,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.85ms. Allocated memory is still 201.3MB. Free memory was 177.1MB in the beginning and 152.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.73ms. Allocated memory is still 201.3MB. Free memory was 152.4MB in the beginning and 149.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,635 INFO L158 Benchmark]: Boogie Preprocessor took 42.82ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,636 INFO L158 Benchmark]: RCFGBuilder took 585.29ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 178.5MB in the end (delta: -30.3MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,636 INFO L158 Benchmark]: TraceAbstraction took 6681.99ms. Allocated memory was 201.3MB in the beginning and 317.7MB in the end (delta: 116.4MB). Free memory was 177.4MB in the beginning and 193.5MB in the end (delta: -16.1MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-12-13 06:26:17,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.85ms. Allocated memory is still 201.3MB. Free memory was 177.1MB in the beginning and 152.4MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.73ms. Allocated memory is still 201.3MB. Free memory was 152.4MB in the beginning and 149.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.82ms. Allocated memory is still 201.3MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 585.29ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 178.5MB in the end (delta: -30.3MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6681.99ms. Allocated memory was 201.3MB in the beginning and 317.7MB in the end (delta: 116.4MB). Free memory was 177.4MB in the beginning and 193.5MB in the end (delta: -16.1MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 91 PlacesBefore, 57 PlacesAfterwards, 86 TransitionsBefore, 51 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 1950, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2043, independent: 1950, independent conditional: 0, independent unconditional: 1950, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 998, independent: 963, independent conditional: 0, independent unconditional: 963, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 998, independent: 954, independent conditional: 0, independent unconditional: 954, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 143, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2043, independent: 987, independent conditional: 0, independent unconditional: 987, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 998, unknown conditional: 0, unknown unconditional: 998] , Statistics on independence cache: Total cache size (in pairs): 2010, Positive cache size: 1975, Positive conditional cache size: 0, Positive unconditional cache size: 1975, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 6, independent unconditional: 18, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 38 PlacesBefore, 38 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 40 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-1, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = x [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: 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: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 106 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 2 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=6, InterpolantAutomatonStates: 28, 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.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-12-13 06:26:17,657 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...