/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:04:24,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:04:24,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:04:24,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:04:24,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:04:24,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:04:24,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:04:24,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:04:24,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:04:24,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:04:24,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:04:24,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:04:24,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:04:24,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:04:24,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:04:24,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:04:24,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:04:24,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:04:24,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:04:24,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:04:24,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:04:24,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:04:24,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:04:24,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:04:24,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:04:24,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:04:24,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:04:24,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:04:24,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:04:24,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:04:24,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:04:24,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:04:24,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:04:24,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:04:24,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:04:24,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:04:24,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:04:24,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:04:24,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:04:24,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:04:24,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:04:24,329 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-NoLbe.epf [2022-12-12 12:04:24,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:04:24,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:04:24,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:04:24,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:04:24,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:04:24,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:04:24,362 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:04:24,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:04:24,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:04:24,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:04:24,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:04:24,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:04:24,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:04:24,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:04:24,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:04:24,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:04:24,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:04:24,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:04:24,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 12:04:24,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:04:24,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:04:24,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:04:24,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:04:24,669 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:04:24,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 12:04:25,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:04:26,247 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:04:26,248 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 12:04:26,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5911fe0/f6ecf38a650746c8922bedc5f7d3151f/FLAGeaf135369 [2022-12-12 12:04:26,308 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5911fe0/f6ecf38a650746c8922bedc5f7d3151f [2022-12-12 12:04:26,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:04:26,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:04:26,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:04:26,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:04:26,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:04:26,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bcf073b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26, skipping insertion in model container [2022-12-12 12:04:26,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:04:26,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:04:26,507 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-12 12:04:26,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:04:26,687 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:04:26,703 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-12 12:04:26,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 12:04:26,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 12:04:26,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:04:26,771 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:04:26,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26 WrapperNode [2022-12-12 12:04:26,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:04:26,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:04:26,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:04:26,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:04:26,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,812 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-12 12:04:26,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:04:26,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:04:26,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:04:26,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:04:26,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,831 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:04:26,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:04:26,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:04:26,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:04:26,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (1/1) ... [2022-12-12 12:04:26,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:04:26,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:04:26,890 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 12:04:26,910 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 12:04:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:04:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 12:04:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:04:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:04:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:04:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 12:04:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 12:04:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 12:04:26,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 12:04:26,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:04:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 12:04:26,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:04:26,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:04:26,927 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 12:04:27,049 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:04:27,051 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:04:27,237 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:04:27,325 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:04:27,325 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 12:04:27,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:04:27 BoogieIcfgContainer [2022-12-12 12:04:27,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:04:27,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:04:27,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:04:27,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:04:27,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:04:26" (1/3) ... [2022-12-12 12:04:27,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a67d992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:04:27, skipping insertion in model container [2022-12-12 12:04:27,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:04:26" (2/3) ... [2022-12-12 12:04:27,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a67d992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:04:27, skipping insertion in model container [2022-12-12 12:04:27,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:04:27" (3/3) ... [2022-12-12 12:04:27,334 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-12-12 12:04:27,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:04:27,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 12:04:27,349 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:04:27,388 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 12:04:27,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-12 12:04:27,458 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-12 12:04:27,458 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:04:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-12 12:04:27,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-12 12:04:27,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-12 12:04:27,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:04:27,484 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;@7d678f08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:04:27,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 12:04:27,499 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-12 12:04:27,499 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 12:04:27,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:27,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:27,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -643617014, now seen corresponding path program 1 times [2022-12-12 12:04:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396788606] [2022-12-12 12:04:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:27,947 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 12:04:27,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396788606] [2022-12-12 12:04:27,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396788606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:27,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:27,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:04:27,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955647378] [2022-12-12 12:04:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:27,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 12:04:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 12:04:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 12:04:27,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 86 [2022-12-12 12:04:27,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 12:04:27,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:27,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 86 [2022-12-12 12:04:27,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:28,082 INFO L130 PetriNetUnfolder]: 18/152 cut-off events. [2022-12-12 12:04:28,082 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 12:04:28,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 152 events. 18/152 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 401 event pairs, 2 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 161. Up to 31 conditions per place. [2022-12-12 12:04:28,085 INFO L137 encePairwiseOnDemand]: 81/86 looper letters, 10 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2022-12-12 12:04:28,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 201 flow [2022-12-12 12:04:28,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 12:04:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 12:04:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2022-12-12 12:04:28,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9263565891472868 [2022-12-12 12:04:28,098 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 0 predicate places. [2022-12-12 12:04:28,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 201 flow [2022-12-12 12:04:28,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 12:04:28,108 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 196 flow [2022-12-12 12:04:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 12:04:28,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:28,109 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, 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, 1] [2022-12-12 12:04:28,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:04:28,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1445001986, now seen corresponding path program 1 times [2022-12-12 12:04:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:28,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042258571] [2022-12-12 12:04:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:28,922 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 12:04:28,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:28,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042258571] [2022-12-12 12:04:28,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042258571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:28,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:28,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:04:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118623095] [2022-12-12 12:04:28,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:28,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:04:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:04:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:04:28,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-12 12:04:28,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 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 12:04:28,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:28,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-12 12:04:28,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:29,472 INFO L130 PetriNetUnfolder]: 323/919 cut-off events. [2022-12-12 12:04:29,473 INFO L131 PetriNetUnfolder]: For 169/291 co-relation queries the response was YES. [2022-12-12 12:04:29,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 919 events. 323/919 cut-off events. For 169/291 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5620 event pairs, 54 based on Foata normal form. 3/890 useless extension candidates. Maximal degree in co-relation 1702. Up to 279 conditions per place. [2022-12-12 12:04:29,482 INFO L137 encePairwiseOnDemand]: 76/86 looper letters, 35 selfloop transitions, 8 changer transitions 66/158 dead transitions. [2022-12-12 12:04:29,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 158 transitions, 616 flow [2022-12-12 12:04:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:04:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:04:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 850 transitions. [2022-12-12 12:04:29,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7602862254025045 [2022-12-12 12:04:29,489 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2022-12-12 12:04:29,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 158 transitions, 616 flow [2022-12-12 12:04:29,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 576 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-12 12:04:29,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 158 transitions, 576 flow [2022-12-12 12:04:29,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 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 12:04:29,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:29,497 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, 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, 1, 1, 1] [2022-12-12 12:04:29,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:04:29,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -938414941, now seen corresponding path program 1 times [2022-12-12 12:04:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:29,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553366555] [2022-12-12 12:04:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:30,064 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 12:04:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:30,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553366555] [2022-12-12 12:04:30,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553366555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:30,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:30,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 12:04:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048229479] [2022-12-12 12:04:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:30,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 12:04:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 12:04:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-12 12:04:30,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 86 [2022-12-12 12:04:30,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 158 transitions, 576 flow. Second operand has 10 states, 10 states have (on average 65.3) internal successors, (653), 10 states have internal predecessors, (653), 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 12:04:30,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:30,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 86 [2022-12-12 12:04:30,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:30,455 INFO L130 PetriNetUnfolder]: 396/1204 cut-off events. [2022-12-12 12:04:30,455 INFO L131 PetriNetUnfolder]: For 278/687 co-relation queries the response was YES. [2022-12-12 12:04:30,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1204 events. 396/1204 cut-off events. For 278/687 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8471 event pairs, 42 based on Foata normal form. 15/1195 useless extension candidates. Maximal degree in co-relation 2732. Up to 371 conditions per place. [2022-12-12 12:04:30,460 INFO L137 encePairwiseOnDemand]: 75/86 looper letters, 31 selfloop transitions, 11 changer transitions 179/279 dead transitions. [2022-12-12 12:04:30,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 279 transitions, 1530 flow [2022-12-12 12:04:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 12:04:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 12:04:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1027 transitions. [2022-12-12 12:04:30,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.796124031007752 [2022-12-12 12:04:30,463 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 24 predicate places. [2022-12-12 12:04:30,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 279 transitions, 1530 flow [2022-12-12 12:04:30,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 279 transitions, 1488 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-12 12:04:30,468 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 279 transitions, 1488 flow [2022-12-12 12:04:30,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.3) internal successors, (653), 10 states have internal predecessors, (653), 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 12:04:30,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:30,469 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, 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, 1, 1, 1, 1] [2022-12-12 12:04:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 12:04:30,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash -923326968, now seen corresponding path program 1 times [2022-12-12 12:04:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007317555] [2022-12-12 12:04:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:31,106 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 12:04:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:31,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007317555] [2022-12-12 12:04:31,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007317555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:31,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:31,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 12:04:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713295692] [2022-12-12 12:04:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:31,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 12:04:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:31,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 12:04:31,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-12 12:04:31,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-12 12:04:31,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 279 transitions, 1488 flow. Second operand has 10 states, 10 states have (on average 59.9) internal successors, (599), 10 states have internal predecessors, (599), 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 12:04:31,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:31,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-12 12:04:31,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:31,812 INFO L130 PetriNetUnfolder]: 488/1598 cut-off events. [2022-12-12 12:04:31,812 INFO L131 PetriNetUnfolder]: For 386/727 co-relation queries the response was YES. [2022-12-12 12:04:31,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4409 conditions, 1598 events. 488/1598 cut-off events. For 386/727 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12527 event pairs, 33 based on Foata normal form. 20/1596 useless extension candidates. Maximal degree in co-relation 4353. Up to 468 conditions per place. [2022-12-12 12:04:31,817 INFO L137 encePairwiseOnDemand]: 70/86 looper letters, 34 selfloop transitions, 20 changer transitions 288/391 dead transitions. [2022-12-12 12:04:31,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 391 transitions, 2860 flow [2022-12-12 12:04:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 12:04:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 12:04:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1095 transitions. [2022-12-12 12:04:31,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7489740082079344 [2022-12-12 12:04:31,821 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 38 predicate places. [2022-12-12 12:04:31,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 391 transitions, 2860 flow [2022-12-12 12:04:31,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 391 transitions, 2648 flow, removed 75 selfloop flow, removed 4 redundant places. [2022-12-12 12:04:31,831 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 391 transitions, 2648 flow [2022-12-12 12:04:31,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 59.9) internal successors, (599), 10 states have internal predecessors, (599), 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 12:04:31,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:31,831 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, 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, 1, 1, 1, 1, 1] [2022-12-12 12:04:31,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:04:31,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1127012891, now seen corresponding path program 1 times [2022-12-12 12:04:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:31,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489793699] [2022-12-12 12:04:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:31,980 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 12:04:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:31,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489793699] [2022-12-12 12:04:31,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489793699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:31,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:31,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 12:04:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235432291] [2022-12-12 12:04:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:31,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 12:04:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 12:04:31,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 12:04:31,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 86 [2022-12-12 12:04:31,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 391 transitions, 2648 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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 12:04:31,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:31,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 86 [2022-12-12 12:04:31,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:32,280 INFO L130 PetriNetUnfolder]: 624/2339 cut-off events. [2022-12-12 12:04:32,280 INFO L131 PetriNetUnfolder]: For 439/1327 co-relation queries the response was YES. [2022-12-12 12:04:32,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2339 events. 624/2339 cut-off events. For 439/1327 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21785 event pairs, 41 based on Foata normal form. 17/2333 useless extension candidates. Maximal degree in co-relation 6873. Up to 758 conditions per place. [2022-12-12 12:04:32,287 INFO L137 encePairwiseOnDemand]: 80/86 looper letters, 46 selfloop transitions, 4 changer transitions 384/493 dead transitions. [2022-12-12 12:04:32,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 493 transitions, 4244 flow [2022-12-12 12:04:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 12:04:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 12:04:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 646 transitions. [2022-12-12 12:04:32,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.834625322997416 [2022-12-12 12:04:32,291 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 42 predicate places. [2022-12-12 12:04:32,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 493 transitions, 4244 flow [2022-12-12 12:04:32,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 493 transitions, 4024 flow, removed 110 selfloop flow, removed 0 redundant places. [2022-12-12 12:04:32,302 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 493 transitions, 4024 flow [2022-12-12 12:04:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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 12:04:32,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:32,302 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, 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, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:32,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:04:32,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2105006328, now seen corresponding path program 1 times [2022-12-12 12:04:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129578153] [2022-12-12 12:04:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:33,269 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 12:04:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:33,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129578153] [2022-12-12 12:04:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129578153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:33,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-12 12:04:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709591110] [2022-12-12 12:04:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:33,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 12:04:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 12:04:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-12 12:04:33,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-12 12:04:33,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 493 transitions, 4024 flow. Second operand has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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 12:04:33,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:33,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-12 12:04:33,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:34,225 INFO L130 PetriNetUnfolder]: 857/3174 cut-off events. [2022-12-12 12:04:34,225 INFO L131 PetriNetUnfolder]: For 780/2103 co-relation queries the response was YES. [2022-12-12 12:04:34,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10886 conditions, 3174 events. 857/3174 cut-off events. For 780/2103 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 31705 event pairs, 6 based on Foata normal form. 35/3185 useless extension candidates. Maximal degree in co-relation 10827. Up to 1045 conditions per place. [2022-12-12 12:04:34,233 INFO L137 encePairwiseOnDemand]: 71/86 looper letters, 46 selfloop transitions, 24 changer transitions 698/817 dead transitions. [2022-12-12 12:04:34,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 817 transitions, 8518 flow [2022-12-12 12:04:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-12 12:04:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-12 12:04:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1586 transitions. [2022-12-12 12:04:34,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7376744186046512 [2022-12-12 12:04:34,239 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 66 predicate places. [2022-12-12 12:04:34,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 817 transitions, 8518 flow [2022-12-12 12:04:34,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 817 transitions, 8372 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-12-12 12:04:34,252 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 817 transitions, 8372 flow [2022-12-12 12:04:34,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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 12:04:34,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:34,253 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, 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, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:34,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:04:34,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash 290197708, now seen corresponding path program 2 times [2022-12-12 12:04:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108632621] [2022-12-12 12:04:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:34,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:34,803 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 12:04:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108632621] [2022-12-12 12:04:34,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108632621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:34,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:34,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-12 12:04:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62618250] [2022-12-12 12:04:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 12:04:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:34,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 12:04:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-12 12:04:34,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 86 [2022-12-12 12:04:34,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 817 transitions, 8372 flow. Second operand has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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 12:04:34,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:34,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 86 [2022-12-12 12:04:34,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:35,647 INFO L130 PetriNetUnfolder]: 915/3468 cut-off events. [2022-12-12 12:04:35,647 INFO L131 PetriNetUnfolder]: For 1015/6050 co-relation queries the response was YES. [2022-12-12 12:04:35,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13499 conditions, 3468 events. 915/3468 cut-off events. For 1015/6050 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 35844 event pairs, 6 based on Foata normal form. 63/3509 useless extension candidates. Maximal degree in co-relation 13439. Up to 1116 conditions per place. [2022-12-12 12:04:35,658 INFO L137 encePairwiseOnDemand]: 72/86 looper letters, 49 selfloop transitions, 20 changer transitions 814/932 dead transitions. [2022-12-12 12:04:35,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 932 transitions, 11370 flow [2022-12-12 12:04:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 12:04:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 12:04:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1278 transitions. [2022-12-12 12:04:35,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7430232558139535 [2022-12-12 12:04:35,661 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 80 predicate places. [2022-12-12 12:04:35,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 932 transitions, 11370 flow [2022-12-12 12:04:35,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 932 transitions, 10475 flow, removed 421 selfloop flow, removed 6 redundant places. [2022-12-12 12:04:35,684 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 932 transitions, 10475 flow [2022-12-12 12:04:35,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 59.81818181818182) internal successors, (658), 11 states have internal predecessors, (658), 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 12:04:35,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:35,685 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:35,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:04:35,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:35,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1297890234, now seen corresponding path program 1 times [2022-12-12 12:04:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:35,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723582113] [2022-12-12 12:04:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:35,874 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 12:04:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723582113] [2022-12-12 12:04:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723582113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:04:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385338837] [2022-12-12 12:04:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:35,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:04:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:04:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:04:35,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 86 [2022-12-12 12:04:35,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 932 transitions, 10475 flow. Second operand has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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 12:04:35,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:35,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 86 [2022-12-12 12:04:35,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:36,208 INFO L130 PetriNetUnfolder]: 493/1485 cut-off events. [2022-12-12 12:04:36,209 INFO L131 PetriNetUnfolder]: For 5187/7656 co-relation queries the response was YES. [2022-12-12 12:04:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 1485 events. 493/1485 cut-off events. For 5187/7656 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10516 event pairs, 11 based on Foata normal form. 255/1699 useless extension candidates. Maximal degree in co-relation 5464. Up to 572 conditions per place. [2022-12-12 12:04:36,214 INFO L137 encePairwiseOnDemand]: 75/86 looper letters, 36 selfloop transitions, 11 changer transitions 233/362 dead transitions. [2022-12-12 12:04:36,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 362 transitions, 3759 flow [2022-12-12 12:04:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:04:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:04:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 910 transitions. [2022-12-12 12:04:36,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.813953488372093 [2022-12-12 12:04:36,217 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 65 predicate places. [2022-12-12 12:04:36,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 362 transitions, 3759 flow [2022-12-12 12:04:36,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 362 transitions, 3270 flow, removed 219 selfloop flow, removed 5 redundant places. [2022-12-12 12:04:36,225 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 362 transitions, 3270 flow [2022-12-12 12:04:36,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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 12:04:36,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:36,225 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:36,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:04:36,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -900107666, now seen corresponding path program 1 times [2022-12-12 12:04:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:36,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233046880] [2022-12-12 12:04:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:36,347 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 12:04:36,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:36,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233046880] [2022-12-12 12:04:36,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233046880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:36,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:36,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 12:04:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24192038] [2022-12-12 12:04:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 12:04:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 12:04:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 12:04:36,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2022-12-12 12:04:36,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 362 transitions, 3270 flow. Second operand has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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 12:04:36,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:36,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2022-12-12 12:04:36,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:36,565 INFO L130 PetriNetUnfolder]: 355/906 cut-off events. [2022-12-12 12:04:36,566 INFO L131 PetriNetUnfolder]: For 4016/5217 co-relation queries the response was YES. [2022-12-12 12:04:36,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 906 events. 355/906 cut-off events. For 4016/5217 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5684 event pairs, 11 based on Foata normal form. 259/1157 useless extension candidates. Maximal degree in co-relation 3600. Up to 280 conditions per place. [2022-12-12 12:04:36,573 INFO L137 encePairwiseOnDemand]: 77/86 looper letters, 30 selfloop transitions, 11 changer transitions 160/258 dead transitions. [2022-12-12 12:04:36,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 258 transitions, 2502 flow [2022-12-12 12:04:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:04:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:04:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 904 transitions. [2022-12-12 12:04:36,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8085867620751341 [2022-12-12 12:04:36,577 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 39 predicate places. [2022-12-12 12:04:36,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 258 transitions, 2502 flow [2022-12-12 12:04:36,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 258 transitions, 2198 flow, removed 130 selfloop flow, removed 4 redundant places. [2022-12-12 12:04:36,584 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 258 transitions, 2198 flow [2022-12-12 12:04:36,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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 12:04:36,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:36,584 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:36,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:04:36,584 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 964487464, now seen corresponding path program 1 times [2022-12-12 12:04:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:36,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128116951] [2022-12-12 12:04:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:04:37,490 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 12:04:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:04:37,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128116951] [2022-12-12 12:04:37,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128116951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:04:37,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:04:37,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-12 12:04:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842567227] [2022-12-12 12:04:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:04:37,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 12:04:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:04:37,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 12:04:37,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-12 12:04:37,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 86 [2022-12-12 12:04:37,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 258 transitions, 2198 flow. Second operand has 14 states, 14 states have (on average 60.57142857142857) internal successors, (848), 14 states have internal predecessors, (848), 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 12:04:37,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:04:37,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 86 [2022-12-12 12:04:37,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:04:37,766 INFO L130 PetriNetUnfolder]: 410/1139 cut-off events. [2022-12-12 12:04:37,767 INFO L131 PetriNetUnfolder]: For 6526/9338 co-relation queries the response was YES. [2022-12-12 12:04:37,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 1139 events. 410/1139 cut-off events. For 6526/9338 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7940 event pairs, 11 based on Foata normal form. 318/1443 useless extension candidates. Maximal degree in co-relation 4089. Up to 268 conditions per place. [2022-12-12 12:04:37,770 INFO L137 encePairwiseOnDemand]: 74/86 looper letters, 20 selfloop transitions, 8 changer transitions 194/273 dead transitions. [2022-12-12 12:04:37,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 273 transitions, 2604 flow [2022-12-12 12:04:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 12:04:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 12:04:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 805 transitions. [2022-12-12 12:04:37,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7200357781753131 [2022-12-12 12:04:37,772 INFO L295 CegarLoopForPetriNet]: 89 programPoint places, 47 predicate places. [2022-12-12 12:04:37,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 273 transitions, 2604 flow [2022-12-12 12:04:37,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 273 transitions, 2408 flow, removed 88 selfloop flow, removed 6 redundant places. [2022-12-12 12:04:37,780 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 273 transitions, 2408 flow [2022-12-12 12:04:37,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 60.57142857142857) internal successors, (848), 14 states have internal predecessors, (848), 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 12:04:37,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:04:37,781 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:37,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 12:04:37,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 12:04:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:04:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671010, now seen corresponding path program 2 times [2022-12-12 12:04:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:04:37,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521195223] [2022-12-12 12:04:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:04:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:04:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:04:37,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 12:04:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 12:04:37,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 12:04:37,844 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 12:04:37,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 12:04:37,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 12:04:37,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 12:04:37,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 12:04:37,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 12:04:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 12:04:37,846 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:04:37,850 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 12:04:37,850 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 12:04:37,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:04:37 BasicIcfg [2022-12-12 12:04:37,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 12:04:37,927 INFO L158 Benchmark]: Toolchain (without parser) took 11614.20ms. Allocated memory was 197.1MB in the beginning and 502.3MB in the end (delta: 305.1MB). Free memory was 171.9MB in the beginning and 238.7MB in the end (delta: -66.8MB). Peak memory consumption was 239.9MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,927 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 12:04:37,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.91ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 147.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.64ms. Allocated memory is still 197.1MB. Free memory was 147.2MB in the beginning and 144.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,927 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 197.1MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,928 INFO L158 Benchmark]: RCFGBuilder took 493.80ms. Allocated memory is still 197.1MB. Free memory was 142.5MB in the beginning and 111.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,929 INFO L158 Benchmark]: TraceAbstraction took 10594.88ms. Allocated memory was 197.1MB in the beginning and 502.3MB in the end (delta: 305.1MB). Free memory was 110.5MB in the beginning and 238.7MB in the end (delta: -128.2MB). Peak memory consumption was 178.0MB. Max. memory is 8.0GB. [2022-12-12 12:04:37,930 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 197.1MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 458.91ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 147.2MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.64ms. Allocated memory is still 197.1MB. Free memory was 147.2MB in the beginning and 144.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 197.1MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 493.80ms. Allocated memory is still 197.1MB. Free memory was 142.5MB in the beginning and 111.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 10594.88ms. Allocated memory was 197.1MB in the beginning and 502.3MB in the end (delta: 305.1MB). Free memory was 110.5MB in the beginning and 238.7MB in the end (delta: -128.2MB). Peak memory consumption was 178.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 965 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 771 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 194 mSDtfsCounter, 1439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10475occurred in iteration=7, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 2549 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 3870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 12:04:37,960 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...