/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 18:38:19,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 18:38:19,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 18:38:19,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 18:38:19,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 18:38:19,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 18:38:19,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 18:38:19,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 18:38:19,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 18:38:19,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 18:38:19,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 18:38:19,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 18:38:19,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 18:38:19,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 18:38:19,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 18:38:19,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 18:38:19,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 18:38:19,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 18:38:19,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 18:38:19,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 18:38:19,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 18:38:19,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 18:38:19,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 18:38:19,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 18:38:19,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 18:38:19,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 18:38:19,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 18:38:19,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 18:38:19,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 18:38:19,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 18:38:19,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 18:38:19,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 18:38:19,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 18:38:19,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 18:38:19,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 18:38:19,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 18:38:19,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 18:38:19,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 18:38:19,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 18:38:19,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 18:38:19,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 18:38:19,353 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-SemanticLbe.epf [2022-12-12 18:38:19,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 18:38:19,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 18:38:19,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 18:38:19,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 18:38:19,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 18:38:19,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 18:38:19,393 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 18:38:19,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 18:38:19,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 18:38:19,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 18:38:19,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 18:38:19,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 18:38:19,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 18:38:19,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 18:38:19,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 18:38:19,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 18:38:19,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 18:38:19,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 18:38:19,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:38:19,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 18:38:19,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 18:38:19,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 18:38:19,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 18:38:19,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 18:38:19,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 18:38:19,397 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 [2022-12-12 18:38:19,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 18:38:19,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 18:38:19,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 18:38:19,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 18:38:19,789 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 18:38:19,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:38:21,038 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 18:38:21,328 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 18:38:21,328 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:38:21,346 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dcd43e8/38ddd1d0e4de43dbaaafd471b3c892c6/FLAGcdf492eb3 [2022-12-12 18:38:21,366 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48dcd43e8/38ddd1d0e4de43dbaaafd471b3c892c6 [2022-12-12 18:38:21,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 18:38:21,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 18:38:21,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 18:38:21,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 18:38:21,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 18:38:21,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:21,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192c4ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21, skipping insertion in model container [2022-12-12 18:38:21,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:21,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 18:38:21,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 18:38:21,596 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 18:38:21,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:38:21,839 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 18:38:21,853 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/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-12 18:38:21,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 18:38:21,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 18:38:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 18:38:21,958 INFO L208 MainTranslator]: Completed translation [2022-12-12 18:38:21,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21 WrapperNode [2022-12-12 18:38:21,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 18:38:21,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 18:38:21,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 18:38:21,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 18:38:21,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:21,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,011 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-12 18:38:22,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 18:38:22,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 18:38:22,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 18:38:22,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 18:38:22,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 18:38:22,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 18:38:22,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 18:38:22,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 18:38:22,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (1/1) ... [2022-12-12 18:38:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 18:38:22,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 18:38:22,101 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-12 18:38:22,127 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-12 18:38:22,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 18:38:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 18:38:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 18:38:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 18:38:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 18:38:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 18:38:22,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 18:38:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 18:38:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-12 18:38:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 18:38:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 18:38:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 18:38:22,149 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 18:38:22,324 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 18:38:22,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 18:38:22,636 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 18:38:22,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 18:38:22,797 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 18:38:22,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:38:22 BoogieIcfgContainer [2022-12-12 18:38:22,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 18:38:22,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 18:38:22,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 18:38:22,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 18:38:22,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 06:38:21" (1/3) ... [2022-12-12 18:38:22,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309f4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:38:22, skipping insertion in model container [2022-12-12 18:38:22,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 06:38:21" (2/3) ... [2022-12-12 18:38:22,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309f4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 06:38:22, skipping insertion in model container [2022-12-12 18:38:22,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 06:38:22" (3/3) ... [2022-12-12 18:38:22,810 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 18:38:22,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 18:38:22,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 18:38:22,828 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 18:38:22,890 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 18:38:22,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-12 18:38:23,028 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-12 18:38:23,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:38:23,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 18:38:23,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-12 18:38:23,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-12 18:38:23,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 18:38:23,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-12 18:38:23,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-12 18:38:23,122 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-12 18:38:23,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:38:23,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-12 18:38:23,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-12 18:38:23,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-12 18:38:28,942 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-12 18:38:28,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 18:38:28,969 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@103d832b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 18:38:28,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 18:38:28,972 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-12 18:38:28,972 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 18:38:28,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:28,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-12 18:38:28,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 572500, now seen corresponding path program 1 times [2022-12-12 18:38:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:28,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359118652] [2022-12-12 18:38:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:29,336 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-12 18:38:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359118652] [2022-12-12 18:38:29,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359118652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:29,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:29,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:38:29,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125448293] [2022-12-12 18:38:29,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:29,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:38:29,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:38:29,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:38:29,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 83 [2022-12-12 18:38:29,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:38:29,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:29,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 83 [2022-12-12 18:38:29,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:39,408 INFO L130 PetriNetUnfolder]: 89490/129391 cut-off events. [2022-12-12 18:38:39,409 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-12 18:38:39,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247130 conditions, 129391 events. 89490/129391 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 5901. Compared 1062831 event pairs, 13430 based on Foata normal form. 0/82283 useless extension candidates. Maximal degree in co-relation 247118. Up to 98405 conditions per place. [2022-12-12 18:38:39,835 INFO L137 encePairwiseOnDemand]: 79/83 looper letters, 52 selfloop transitions, 2 changer transitions 71/140 dead transitions. [2022-12-12 18:38:39,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 140 transitions, 549 flow [2022-12-12 18:38:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-12-12 18:38:39,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2022-12-12 18:38:39,850 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, 0 predicate places. [2022-12-12 18:38:39,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 140 transitions, 549 flow [2022-12-12 18:38:40,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 69 transitions, 267 flow [2022-12-12 18:38:40,052 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 267 flow [2022-12-12 18:38:40,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:38:40,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:40,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:40,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 18:38:40,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1165077413, now seen corresponding path program 1 times [2022-12-12 18:38:40,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951266589] [2022-12-12 18:38:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:40,358 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-12 18:38:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951266589] [2022-12-12 18:38:40,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951266589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:40,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:40,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:38:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430672626] [2022-12-12 18:38:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:40,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:38:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:40,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:38:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:38:40,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:38:40,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-12 18:38:40,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:40,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:38:40,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:45,373 INFO L130 PetriNetUnfolder]: 50411/69714 cut-off events. [2022-12-12 18:38:45,374 INFO L131 PetriNetUnfolder]: For 7131/7131 co-relation queries the response was YES. [2022-12-12 18:38:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193230 conditions, 69714 events. 50411/69714 cut-off events. For 7131/7131 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 453855 event pairs, 3805 based on Foata normal form. 1666/59382 useless extension candidates. Maximal degree in co-relation 193215. Up to 48445 conditions per place. [2022-12-12 18:38:45,752 INFO L137 encePairwiseOnDemand]: 72/83 looper letters, 90 selfloop transitions, 16 changer transitions 2/119 dead transitions. [2022-12-12 18:38:45,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 119 transitions, 687 flow [2022-12-12 18:38:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-12-12 18:38:45,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40160642570281124 [2022-12-12 18:38:45,755 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -34 predicate places. [2022-12-12 18:38:45,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 119 transitions, 687 flow [2022-12-12 18:38:45,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 117 transitions, 679 flow [2022-12-12 18:38:45,935 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 117 transitions, 679 flow [2022-12-12 18:38:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-12 18:38:45,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:45,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:45,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 18:38:45,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1757661410, now seen corresponding path program 1 times [2022-12-12 18:38:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11646180] [2022-12-12 18:38:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:46,091 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-12 18:38:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:46,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11646180] [2022-12-12 18:38:46,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11646180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:46,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:46,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:38:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006538595] [2022-12-12 18:38:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:46,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:46,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:38:46,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 117 transitions, 679 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 18:38:46,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:46,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:38:46,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:49,932 INFO L130 PetriNetUnfolder]: 36514/51194 cut-off events. [2022-12-12 18:38:49,932 INFO L131 PetriNetUnfolder]: For 3524/3524 co-relation queries the response was YES. [2022-12-12 18:38:50,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192643 conditions, 51194 events. 36514/51194 cut-off events. For 3524/3524 co-relation queries the response was YES. Maximal size of possible extension queue 1706. Compared 325007 event pairs, 1388 based on Foata normal form. 498/42869 useless extension candidates. Maximal degree in co-relation 192625. Up to 37224 conditions per place. [2022-12-12 18:38:50,171 INFO L137 encePairwiseOnDemand]: 74/83 looper letters, 142 selfloop transitions, 14 changer transitions 4/171 dead transitions. [2022-12-12 18:38:50,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 171 transitions, 1311 flow [2022-12-12 18:38:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-12 18:38:50,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3614457831325301 [2022-12-12 18:38:50,173 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -32 predicate places. [2022-12-12 18:38:50,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 171 transitions, 1311 flow [2022-12-12 18:38:50,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 167 transitions, 1279 flow [2022-12-12 18:38:50,331 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 167 transitions, 1279 flow [2022-12-12 18:38:50,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-12 18:38:50,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:50,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:50,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 18:38:50,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1347135581, now seen corresponding path program 1 times [2022-12-12 18:38:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:50,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951339945] [2022-12-12 18:38:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:50,480 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-12 18:38:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:50,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951339945] [2022-12-12 18:38:50,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951339945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:50,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:50,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:38:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380954580] [2022-12-12 18:38:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:50,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:50,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:38:50,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 167 transitions, 1279 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-12 18:38:50,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:50,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:38:50,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:53,901 INFO L130 PetriNetUnfolder]: 32520/45714 cut-off events. [2022-12-12 18:38:53,902 INFO L131 PetriNetUnfolder]: For 3588/3588 co-relation queries the response was YES. [2022-12-12 18:38:54,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215243 conditions, 45714 events. 32520/45714 cut-off events. For 3588/3588 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 285135 event pairs, 1392 based on Foata normal form. 60/38485 useless extension candidates. Maximal degree in co-relation 215222. Up to 33138 conditions per place. [2022-12-12 18:38:54,297 INFO L137 encePairwiseOnDemand]: 73/83 looper letters, 205 selfloop transitions, 32 changer transitions 0/248 dead transitions. [2022-12-12 18:38:54,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 248 transitions, 2405 flow [2022-12-12 18:38:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:38:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:38:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-12 18:38:54,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3795180722891566 [2022-12-12 18:38:54,299 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -30 predicate places. [2022-12-12 18:38:54,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 248 transitions, 2405 flow [2022-12-12 18:38:54,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 248 transitions, 2405 flow [2022-12-12 18:38:54,476 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 248 transitions, 2405 flow [2022-12-12 18:38:54,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-12 18:38:54,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:54,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:54,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 18:38:54,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:54,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1188376676, now seen corresponding path program 1 times [2022-12-12 18:38:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:54,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032246542] [2022-12-12 18:38:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:54,587 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-12 18:38:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:54,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032246542] [2022-12-12 18:38:54,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032246542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:54,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:54,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 18:38:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007217351] [2022-12-12 18:38:54,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:54,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:38:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:38:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:38:54,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2022-12-12 18:38:54,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 248 transitions, 2405 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-12 18:38:54,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:54,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2022-12-12 18:38:54,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:38:58,299 INFO L130 PetriNetUnfolder]: 32187/45256 cut-off events. [2022-12-12 18:38:58,300 INFO L131 PetriNetUnfolder]: For 10965/10965 co-relation queries the response was YES. [2022-12-12 18:38:58,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252503 conditions, 45256 events. 32187/45256 cut-off events. For 10965/10965 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 281533 event pairs, 1352 based on Foata normal form. 50/38064 useless extension candidates. Maximal degree in co-relation 252479. Up to 38275 conditions per place. [2022-12-12 18:38:58,554 INFO L137 encePairwiseOnDemand]: 79/83 looper letters, 326 selfloop transitions, 22 changer transitions 0/371 dead transitions. [2022-12-12 18:38:58,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 371 transitions, 4340 flow [2022-12-12 18:38:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:38:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:38:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-12 18:38:58,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37751004016064255 [2022-12-12 18:38:58,556 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -28 predicate places. [2022-12-12 18:38:58,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 371 transitions, 4340 flow [2022-12-12 18:38:58,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 371 transitions, 4340 flow [2022-12-12 18:38:58,737 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 371 transitions, 4340 flow [2022-12-12 18:38:58,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-12 18:38:58,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:38:58,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:38:58,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 18:38:58,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:38:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:38:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1752264893, now seen corresponding path program 1 times [2022-12-12 18:38:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:38:58,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407255044] [2022-12-12 18:38:58,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:38:58,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:38:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:38:58,867 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-12 18:38:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:38:58,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407255044] [2022-12-12 18:38:58,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407255044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:38:58,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:38:58,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:38:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073788024] [2022-12-12 18:38:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:38:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:38:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:38:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:38:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:38:58,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:38:58,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 371 transitions, 4340 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 18:38:58,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:38:58,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:38:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:05,095 INFO L130 PetriNetUnfolder]: 47361/67190 cut-off events. [2022-12-12 18:39:05,095 INFO L131 PetriNetUnfolder]: For 18543/18543 co-relation queries the response was YES. [2022-12-12 18:39:05,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439504 conditions, 67190 events. 47361/67190 cut-off events. For 18543/18543 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 450128 event pairs, 950 based on Foata normal form. 720/56226 useless extension candidates. Maximal degree in co-relation 439477. Up to 58049 conditions per place. [2022-12-12 18:39:05,494 INFO L137 encePairwiseOnDemand]: 73/83 looper letters, 402 selfloop transitions, 56 changer transitions 16/485 dead transitions. [2022-12-12 18:39:05,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 485 transitions, 6638 flow [2022-12-12 18:39:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-12-12 18:39:05,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4006024096385542 [2022-12-12 18:39:05,496 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -25 predicate places. [2022-12-12 18:39:05,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 485 transitions, 6638 flow [2022-12-12 18:39:05,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 469 transitions, 6430 flow [2022-12-12 18:39:05,886 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 469 transitions, 6430 flow [2022-12-12 18:39:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-12 18:39:05,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:05,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:05,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 18:39:05,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1752207233, now seen corresponding path program 1 times [2022-12-12 18:39:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:05,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468992824] [2022-12-12 18:39:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:06,036 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-12 18:39:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468992824] [2022-12-12 18:39:06,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468992824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:06,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:06,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309334115] [2022-12-12 18:39:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:06,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:06,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:06,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:39:06,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 469 transitions, 6430 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:39:06,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:06,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:39:06,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:16,181 INFO L130 PetriNetUnfolder]: 71530/98148 cut-off events. [2022-12-12 18:39:16,182 INFO L131 PetriNetUnfolder]: For 216386/217723 co-relation queries the response was YES. [2022-12-12 18:39:16,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679257 conditions, 98148 events. 71530/98148 cut-off events. For 216386/217723 co-relation queries the response was YES. Maximal size of possible extension queue 3584. Compared 642526 event pairs, 10956 based on Foata normal form. 1246/84081 useless extension candidates. Maximal degree in co-relation 679227. Up to 88297 conditions per place. [2022-12-12 18:39:16,768 INFO L137 encePairwiseOnDemand]: 69/83 looper letters, 569 selfloop transitions, 135 changer transitions 0/740 dead transitions. [2022-12-12 18:39:16,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 740 transitions, 11629 flow [2022-12-12 18:39:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-12-12 18:39:16,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39357429718875503 [2022-12-12 18:39:16,770 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -23 predicate places. [2022-12-12 18:39:16,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 740 transitions, 11629 flow [2022-12-12 18:39:17,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 740 transitions, 11629 flow [2022-12-12 18:39:17,147 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 740 transitions, 11629 flow [2022-12-12 18:39:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-12 18:39:17,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:17,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 18:39:17,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1998538365, now seen corresponding path program 1 times [2022-12-12 18:39:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413961035] [2022-12-12 18:39:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:17,285 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-12 18:39:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:17,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413961035] [2022-12-12 18:39:17,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413961035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:17,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:17,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896606013] [2022-12-12 18:39:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:17,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:17,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2022-12-12 18:39:17,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 740 transitions, 11629 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-12 18:39:17,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:17,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2022-12-12 18:39:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:37,737 INFO L130 PetriNetUnfolder]: 112782/155202 cut-off events. [2022-12-12 18:39:37,737 INFO L131 PetriNetUnfolder]: For 467436/468967 co-relation queries the response was YES. [2022-12-12 18:39:38,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192251 conditions, 155202 events. 112782/155202 cut-off events. For 467436/468967 co-relation queries the response was YES. Maximal size of possible extension queue 5685. Compared 1077606 event pairs, 19662 based on Foata normal form. 1971/131381 useless extension candidates. Maximal degree in co-relation 1192218. Up to 142301 conditions per place. [2022-12-12 18:39:38,751 INFO L137 encePairwiseOnDemand]: 80/83 looper letters, 817 selfloop transitions, 31 changer transitions 111/985 dead transitions. [2022-12-12 18:39:38,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 985 transitions, 17489 flow [2022-12-12 18:39:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:39:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:39:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-12-12 18:39:38,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39357429718875503 [2022-12-12 18:39:38,753 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -21 predicate places. [2022-12-12 18:39:38,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 985 transitions, 17489 flow [2022-12-12 18:39:39,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 874 transitions, 15495 flow [2022-12-12 18:39:39,226 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 874 transitions, 15495 flow [2022-12-12 18:39:39,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-12 18:39:39,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:39,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:39,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 18:39:39,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash 486386231, now seen corresponding path program 1 times [2022-12-12 18:39:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:39,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054035996] [2022-12-12 18:39:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:39,398 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-12 18:39:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:39,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054035996] [2022-12-12 18:39:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054035996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:39,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:39,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 18:39:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457507060] [2022-12-12 18:39:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 18:39:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 18:39:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 18:39:39,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:39:39,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 874 transitions, 15495 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 18:39:39,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:39,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:39:39,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:39:53,660 INFO L130 PetriNetUnfolder]: 64574/95499 cut-off events. [2022-12-12 18:39:53,660 INFO L131 PetriNetUnfolder]: For 299243/301749 co-relation queries the response was YES. [2022-12-12 18:39:53,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818764 conditions, 95499 events. 64574/95499 cut-off events. For 299243/301749 co-relation queries the response was YES. Maximal size of possible extension queue 4285. Compared 733521 event pairs, 7032 based on Foata normal form. 4284/84006 useless extension candidates. Maximal degree in co-relation 818728. Up to 86697 conditions per place. [2022-12-12 18:39:54,332 INFO L137 encePairwiseOnDemand]: 69/83 looper letters, 671 selfloop transitions, 285 changer transitions 83/1072 dead transitions. [2022-12-12 18:39:54,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 1072 transitions, 21099 flow [2022-12-12 18:39:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 18:39:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 18:39:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-12-12 18:39:54,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40963855421686746 [2022-12-12 18:39:54,334 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -18 predicate places. [2022-12-12 18:39:54,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 1072 transitions, 21099 flow [2022-12-12 18:39:54,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 989 transitions, 19439 flow [2022-12-12 18:39:54,608 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 989 transitions, 19439 flow [2022-12-12 18:39:54,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 18:39:54,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:39:54,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:39:54,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 18:39:54,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:39:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:39:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1460963492, now seen corresponding path program 1 times [2022-12-12 18:39:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:39:54,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351348391] [2022-12-12 18:39:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:39:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:39:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:39:54,750 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-12 18:39:54,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:39:54,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351348391] [2022-12-12 18:39:54,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351348391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:39:54,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:39:54,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 18:39:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569743918] [2022-12-12 18:39:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:39:54,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 18:39:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:39:54,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 18:39:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 18:39:54,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 83 [2022-12-12 18:39:54,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 989 transitions, 19439 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-12 18:39:54,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:39:54,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 83 [2022-12-12 18:39:54,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:40:16,341 INFO L130 PetriNetUnfolder]: 87624/132799 cut-off events. [2022-12-12 18:40:16,341 INFO L131 PetriNetUnfolder]: For 499932/502203 co-relation queries the response was YES. [2022-12-12 18:40:16,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232561 conditions, 132799 events. 87624/132799 cut-off events. For 499932/502203 co-relation queries the response was YES. Maximal size of possible extension queue 6883. Compared 1125816 event pairs, 10521 based on Foata normal form. 2023/113806 useless extension candidates. Maximal degree in co-relation 1232522. Up to 121699 conditions per place. [2022-12-12 18:40:17,015 INFO L137 encePairwiseOnDemand]: 80/83 looper letters, 948 selfloop transitions, 23 changer transitions 362/1372 dead transitions. [2022-12-12 18:40:17,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 1372 transitions, 29789 flow [2022-12-12 18:40:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 18:40:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 18:40:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-12 18:40:17,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37751004016064255 [2022-12-12 18:40:17,017 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -16 predicate places. [2022-12-12 18:40:17,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 1372 transitions, 29789 flow [2022-12-12 18:40:17,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 1010 transitions, 21832 flow [2022-12-12 18:40:17,338 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 1010 transitions, 21832 flow [2022-12-12 18:40:17,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-12 18:40:17,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:40:17,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:17,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 18:40:17,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:40:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:40:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -800086336, now seen corresponding path program 1 times [2022-12-12 18:40:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:40:17,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722204838] [2022-12-12 18:40:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:40:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:40:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:40:17,513 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-12 18:40:17,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:40:17,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722204838] [2022-12-12 18:40:17,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722204838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:40:17,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:40:17,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 18:40:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393672766] [2022-12-12 18:40:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:40:17,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 18:40:17,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:40:17,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 18:40:17,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 18:40:17,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:40:17,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 1010 transitions, 21832 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-12 18:40:17,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:40:17,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:40:17,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:40:27,154 INFO L130 PetriNetUnfolder]: 28950/49633 cut-off events. [2022-12-12 18:40:27,154 INFO L131 PetriNetUnfolder]: For 281623/284302 co-relation queries the response was YES. [2022-12-12 18:40:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505111 conditions, 49633 events. 28950/49633 cut-off events. For 281623/284302 co-relation queries the response was YES. Maximal size of possible extension queue 2724. Compared 448041 event pairs, 1149 based on Foata normal form. 4856/46467 useless extension candidates. Maximal degree in co-relation 505069. Up to 44101 conditions per place. [2022-12-12 18:40:27,544 INFO L137 encePairwiseOnDemand]: 69/83 looper letters, 472 selfloop transitions, 303 changer transitions 309/1106 dead transitions. [2022-12-12 18:40:27,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 1106 transitions, 26034 flow [2022-12-12 18:40:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 18:40:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 18:40:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2022-12-12 18:40:27,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41445783132530123 [2022-12-12 18:40:27,546 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -12 predicate places. [2022-12-12 18:40:27,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 1106 transitions, 26034 flow [2022-12-12 18:40:27,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 797 transitions, 18721 flow [2022-12-12 18:40:27,701 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 797 transitions, 18721 flow [2022-12-12 18:40:27,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-12 18:40:27,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:40:27,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 18:40:27,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:40:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:40:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1565542700, now seen corresponding path program 1 times [2022-12-12 18:40:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:40:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523846104] [2022-12-12 18:40:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:40:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:40:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:40:27,949 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-12 18:40:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:40:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523846104] [2022-12-12 18:40:27,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523846104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:40:27,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:40:27,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 18:40:27,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400266575] [2022-12-12 18:40:27,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:40:27,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 18:40:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:40:27,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 18:40:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-12 18:40:27,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 83 [2022-12-12 18:40:27,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 797 transitions, 18721 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 18:40:27,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:40:27,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 83 [2022-12-12 18:40:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:40:32,794 INFO L130 PetriNetUnfolder]: 15909/26529 cut-off events. [2022-12-12 18:40:32,794 INFO L131 PetriNetUnfolder]: For 187701/189683 co-relation queries the response was YES. [2022-12-12 18:40:32,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292753 conditions, 26529 events. 15909/26529 cut-off events. For 187701/189683 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 210436 event pairs, 61 based on Foata normal form. 2651/24482 useless extension candidates. Maximal degree in co-relation 292708. Up to 23597 conditions per place. [2022-12-12 18:40:32,912 INFO L137 encePairwiseOnDemand]: 69/83 looper letters, 120 selfloop transitions, 97 changer transitions 564/790 dead transitions. [2022-12-12 18:40:32,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 790 transitions, 20089 flow [2022-12-12 18:40:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:40:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:40:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2022-12-12 18:40:32,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36947791164658633 [2022-12-12 18:40:32,915 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -7 predicate places. [2022-12-12 18:40:32,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 790 transitions, 20089 flow [2022-12-12 18:40:32,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 226 transitions, 5524 flow [2022-12-12 18:40:32,980 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 226 transitions, 5524 flow [2022-12-12 18:40:32,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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-12 18:40:32,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:40:32,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:32,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 18:40:32,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:40:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:40:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1249507565, now seen corresponding path program 1 times [2022-12-12 18:40:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:40:32,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378755204] [2022-12-12 18:40:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:40:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:40:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:40:34,740 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-12 18:40:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:40:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378755204] [2022-12-12 18:40:34,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378755204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:40:34,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:40:34,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:40:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037015302] [2022-12-12 18:40:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:40:34,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 18:40:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:40:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 18:40:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 18:40:34,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2022-12-12 18:40:34,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 226 transitions, 5524 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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-12 18:40:34,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:40:34,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2022-12-12 18:40:34,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:40:36,081 INFO L130 PetriNetUnfolder]: 6214/9702 cut-off events. [2022-12-12 18:40:36,082 INFO L131 PetriNetUnfolder]: For 65159/65230 co-relation queries the response was YES. [2022-12-12 18:40:36,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117542 conditions, 9702 events. 6214/9702 cut-off events. For 65159/65230 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 57405 event pairs, 2 based on Foata normal form. 98/7768 useless extension candidates. Maximal degree in co-relation 117494. Up to 9301 conditions per place. [2022-12-12 18:40:36,142 INFO L137 encePairwiseOnDemand]: 77/83 looper letters, 231 selfloop transitions, 12 changer transitions 180/447 dead transitions. [2022-12-12 18:40:36,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 447 transitions, 12165 flow [2022-12-12 18:40:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 18:40:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 18:40:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-12-12 18:40:36,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3534136546184739 [2022-12-12 18:40:36,144 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, -4 predicate places. [2022-12-12 18:40:36,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 447 transitions, 12165 flow [2022-12-12 18:40:36,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 267 transitions, 7082 flow [2022-12-12 18:40:36,192 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 267 transitions, 7082 flow [2022-12-12 18:40:36,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 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-12 18:40:36,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:40:36,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:36,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-12 18:40:36,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:40:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:40:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 819874243, now seen corresponding path program 1 times [2022-12-12 18:40:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:40:36,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188151001] [2022-12-12 18:40:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:40:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:40:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 18:40:36,847 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-12 18:40:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 18:40:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188151001] [2022-12-12 18:40:36,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188151001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 18:40:36,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 18:40:36,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 18:40:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495860026] [2022-12-12 18:40:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 18:40:36,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 18:40:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 18:40:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 18:40:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 18:40:36,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 83 [2022-12-12 18:40:36,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 267 transitions, 7082 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 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-12 18:40:36,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 18:40:36,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 83 [2022-12-12 18:40:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 18:40:38,469 INFO L130 PetriNetUnfolder]: 6889/10878 cut-off events. [2022-12-12 18:40:38,469 INFO L131 PetriNetUnfolder]: For 71732/71732 co-relation queries the response was YES. [2022-12-12 18:40:38,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137951 conditions, 10878 events. 6889/10878 cut-off events. For 71732/71732 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 69911 event pairs, 0 based on Foata normal form. 81/8424 useless extension candidates. Maximal degree in co-relation 137900. Up to 10664 conditions per place. [2022-12-12 18:40:38,553 INFO L137 encePairwiseOnDemand]: 75/83 looper letters, 363 selfloop transitions, 31 changer transitions 110/528 dead transitions. [2022-12-12 18:40:38,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 528 transitions, 15419 flow [2022-12-12 18:40:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 18:40:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 18:40:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2022-12-12 18:40:38,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33390705679862304 [2022-12-12 18:40:38,555 INFO L295 CegarLoopForPetriNet]: 96 programPoint places, 0 predicate places. [2022-12-12 18:40:38,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 528 transitions, 15419 flow [2022-12-12 18:40:38,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 418 transitions, 12116 flow [2022-12-12 18:40:38,616 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 418 transitions, 12116 flow [2022-12-12 18:40:38,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 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-12 18:40:38,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 18:40:38,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:38,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 18:40:38,617 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 18:40:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 18:40:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1744585723, now seen corresponding path program 2 times [2022-12-12 18:40:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 18:40:38,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530074863] [2022-12-12 18:40:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 18:40:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 18:40:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:40:38,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 18:40:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 18:40:38,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 18:40:38,777 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 18:40:38,778 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 18:40:38,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-12 18:40:38,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 18:40:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 18:40:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 18:40:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 18:40:38,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-12 18:40:38,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-12 18:40:38,780 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 18:40:38,787 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 18:40:38,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 18:40:38,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 06:40:38 BasicIcfg [2022-12-12 18:40:38,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 18:40:38,882 INFO L158 Benchmark]: Toolchain (without parser) took 137512.21ms. Allocated memory was 182.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 144.9MB in the beginning and 6.8GB in the end (delta: -6.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-12 18:40:38,882 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 18:40:38,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.86ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 116.6MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 18:40:38,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.41ms. Allocated memory is still 182.5MB. Free memory was 116.6MB in the beginning and 114.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 18:40:38,883 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 111.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 18:40:38,884 INFO L158 Benchmark]: RCFGBuilder took 755.08ms. Allocated memory is still 182.5MB. Free memory was 111.9MB in the beginning and 74.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-12 18:40:38,884 INFO L158 Benchmark]: TraceAbstraction took 136077.03ms. Allocated memory was 182.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 73.1MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-12 18:40:38,885 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 182.5MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 585.86ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 116.6MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.41ms. Allocated memory is still 182.5MB. Free memory was 116.6MB in the beginning and 114.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 111.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 755.08ms. Allocated memory is still 182.5MB. Free memory was 111.9MB in the beginning and 74.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 136077.03ms. Allocated memory was 182.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 73.1MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 138 PlacesBefore, 96 PlacesAfterwards, 127 TransitionsBefore, 83 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 53 ConcurrentYvCompositions, 4 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4643, independent: 4432, independent conditional: 4432, independent unconditional: 0, dependent: 211, dependent conditional: 211, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4643, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4643, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4643, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2864, independent: 2791, independent conditional: 0, independent unconditional: 2791, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2864, independent: 2753, independent conditional: 0, independent unconditional: 2753, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4643, independent: 1641, independent conditional: 0, independent unconditional: 1641, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 2864, unknown conditional: 0, unknown unconditional: 2864] , Statistics on independence cache: Total cache size (in pairs): 4951, Positive cache size: 4878, Positive conditional cache size: 0, Positive unconditional cache size: 4878, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool b$flush_delayed; [L720] 0 int b$mem_tmp; [L721] 0 _Bool b$r_buff0_thd0; [L722] 0 _Bool b$r_buff0_thd1; [L723] 0 _Bool b$r_buff0_thd2; [L724] 0 _Bool b$r_buff0_thd3; [L725] 0 _Bool b$r_buff0_thd4; [L726] 0 _Bool b$r_buff1_thd0; [L727] 0 _Bool b$r_buff1_thd1; [L728] 0 _Bool b$r_buff1_thd2; [L729] 0 _Bool b$r_buff1_thd3; [L730] 0 _Bool b$r_buff1_thd4; [L731] 0 _Bool b$read_delayed; [L732] 0 int *b$read_delayed_var; [L733] 0 int b$w_buff0; [L734] 0 _Bool b$w_buff0_used; [L735] 0 int b$w_buff1; [L736] 0 _Bool b$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L867] 0 pthread_t t1249; [L868] FCALL, FORK 0 pthread_create(&t1249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1249, ((void *)0), P0, ((void *)0))=-2, t1249={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1250; [L870] FCALL, FORK 0 pthread_create(&t1250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1250, ((void *)0), P1, ((void *)0))=-1, t1249={5:0}, t1250={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1251; [L872] FCALL, FORK 0 pthread_create(&t1251, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1251, ((void *)0), P2, ((void *)0))=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1252; [L874] FCALL, FORK 0 pthread_create(&t1252, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1252, ((void *)0), P3, ((void *)0))=1, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 b$w_buff1 = b$w_buff0 [L751] 1 b$w_buff0 = 1 [L752] 1 b$w_buff1_used = b$w_buff0_used [L753] 1 b$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L755] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L756] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L757] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L758] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L759] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L787] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L788] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L789] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L790] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L806] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L807] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L808] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L809] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L810] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L829] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 4 b$flush_delayed = weak$$choice2 [L832] 4 b$mem_tmp = b [L833] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L834] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L835] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L836] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L837] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L839] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 __unbuffered_p3_EBX = b [L841] 4 b = b$flush_delayed ? b$mem_tmp : b [L842] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L845] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L846] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L847] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L848] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L849] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L881] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L882] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L883] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L884] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1249={5:0}, t1250={6:0}, t1251={7:0}, t1252={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2] - 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: 868]: 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: 872]: 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: 874]: 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: 870]: 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 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 135.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 121.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 572 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 22 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21832occurred in iteration=10, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 42405 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12 18:40:38,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...