/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 18:55:50,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 18:55:50,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 18:55:50,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 18:55:50,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 18:55:50,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 18:55:50,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 18:55:50,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 18:55:50,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 18:55:50,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 18:55:50,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 18:55:50,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 18:55:50,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 18:55:50,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 18:55:50,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 18:55:50,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 18:55:50,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 18:55:50,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 18:55:50,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 18:55:50,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 18:55:50,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 18:55:50,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 18:55:50,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 18:55:50,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 18:55:50,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 18:55:50,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 18:55:50,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 18:55:50,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 18:55:50,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 18:55:50,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 18:55:50,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 18:55:50,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 18:55:50,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 18:55:50,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 18:55:50,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 18:55:50,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 18:55:50,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 18:55:50,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 18:55:50,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 18:55:50,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 18:55:50,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 18:55:50,462 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-11 18:55:50,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 18:55:50,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 18:55:50,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 18:55:50,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 18:55:50,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 18:55:50,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 18:55:50,488 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 18:55:50,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 18:55:50,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 18:55:50,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 18:55:50,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 18:55:50,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 18:55:50,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 18:55:50,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 18:55:50,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 18:55:50,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 18:55:50,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:55:50,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 18:55:50,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 18:55:50,493 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 [2022-12-11 18:55:50,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 18:55:50,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 18:55:50,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 18:55:50,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 18:55:50,818 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 18:55:50,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2022-12-11 18:55:52,034 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 18:55:52,313 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 18:55:52,313 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2022-12-11 18:55:52,331 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089c7df49/20c19a5f66bd49efab4bfce982d53d44/FLAGcdfa34acd [2022-12-11 18:55:52,345 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089c7df49/20c19a5f66bd49efab4bfce982d53d44 [2022-12-11 18:55:52,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 18:55:52,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 18:55:52,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 18:55:52,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 18:55:52,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 18:55:52,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:52,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201224f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52, skipping insertion in model container [2022-12-11 18:55:52,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:52,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 18:55:52,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 18:55:52,603 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/mix000.opt.i[987,1000] [2022-12-11 18:55:52,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:55:52,847 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 18:55:52,859 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/mix000.opt.i[987,1000] [2022-12-11 18:55:52,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 18:55:52,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 18:55:52,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 18:55:52,964 INFO L208 MainTranslator]: Completed translation [2022-12-11 18:55:52,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52 WrapperNode [2022-12-11 18:55:52,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 18:55:52,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 18:55:52,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 18:55:52,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 18:55:52,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,035 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-11 18:55:53,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 18:55:53,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 18:55:53,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 18:55:53,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 18:55:53,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,058 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 18:55:53,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 18:55:53,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 18:55:53,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 18:55:53,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (1/1) ... [2022-12-11 18:55:53,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 18:55:53,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 18:55:53,117 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-11 18:55:53,140 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-11 18:55:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 18:55:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 18:55:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 18:55:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 18:55:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 18:55:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 18:55:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 18:55:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 18:55:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 18:55:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 18:55:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 18:55:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 18:55:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 18:55:53,157 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 18:55:53,296 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 18:55:53,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 18:55:53,618 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 18:55:53,751 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 18:55:53,751 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 18:55:53,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:55:53 BoogieIcfgContainer [2022-12-11 18:55:53,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 18:55:53,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 18:55:53,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 18:55:53,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 18:55:53,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 06:55:52" (1/3) ... [2022-12-11 18:55:53,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db91bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:55:53, skipping insertion in model container [2022-12-11 18:55:53,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 06:55:52" (2/3) ... [2022-12-11 18:55:53,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db91bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 06:55:53, skipping insertion in model container [2022-12-11 18:55:53,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 06:55:53" (3/3) ... [2022-12-11 18:55:53,793 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2022-12-11 18:55:53,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 18:55:53,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 18:55:53,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 18:55:53,881 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 18:55:53,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-11 18:55:53,977 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-11 18:55:53,978 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:55:53,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-11 18:55:53,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-11 18:55:53,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-11 18:55:53,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 18:55:54,005 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;@93e3d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 18:55:54,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 18:55:54,033 INFO L130 PetriNetUnfolder]: 0/55 cut-off events. [2022-12-11 18:55:54,033 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 18:55:54,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:54,035 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] [2022-12-11 18:55:54,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 755983223, now seen corresponding path program 1 times [2022-12-11 18:55:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121514378] [2022-12-11 18:55:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:54,597 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-11 18:55:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121514378] [2022-12-11 18:55:54,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121514378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 18:55:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867673750] [2022-12-11 18:55:54,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:54,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 18:55:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 18:55:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 18:55:54,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2022-12-11 18:55:54,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-11 18:55:54,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:54,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2022-12-11 18:55:54,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:54,741 INFO L130 PetriNetUnfolder]: 14/128 cut-off events. [2022-12-11 18:55:54,742 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 18:55:54,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 128 events. 14/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 2 based on Foata normal form. 8/128 useless extension candidates. Maximal degree in co-relation 124. Up to 25 conditions per place. [2022-12-11 18:55:54,746 INFO L137 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2022-12-11 18:55:54,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 200 flow [2022-12-11 18:55:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 18:55:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 18:55:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2022-12-11 18:55:54,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2022-12-11 18:55:54,764 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 252 transitions. [2022-12-11 18:55:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 200 flow [2022-12-11 18:55:54,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:55:54,772 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 178 flow [2022-12-11 18:55:54,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2022-12-11 18:55:54,778 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2022-12-11 18:55:54,778 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 178 flow [2022-12-11 18:55:54,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-11 18:55:54,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:54,779 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-11 18:55:54,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 18:55:54,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1650213651, now seen corresponding path program 1 times [2022-12-11 18:55:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:54,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241719645] [2022-12-11 18:55:54,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:54,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:55,226 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-11 18:55:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:55,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241719645] [2022-12-11 18:55:55,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241719645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:55,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:55,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:55:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044714813] [2022-12-11 18:55:55,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:55,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:55:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:55,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:55:55,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:55:55,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2022-12-11 18:55:55,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 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-11 18:55:55,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:55,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2022-12-11 18:55:55,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:55,527 INFO L130 PetriNetUnfolder]: 205/612 cut-off events. [2022-12-11 18:55:55,528 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-11 18:55:55,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 612 events. 205/612 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3346 event pairs, 47 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 966. Up to 167 conditions per place. [2022-12-11 18:55:55,536 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 18 selfloop transitions, 4 changer transitions 41/121 dead transitions. [2022-12-11 18:55:55,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 121 transitions, 368 flow [2022-12-11 18:55:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:55:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:55:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 728 transitions. [2022-12-11 18:55:55,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8 [2022-12-11 18:55:55,544 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 178 flow. Second operand 10 states and 728 transitions. [2022-12-11 18:55:55,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 121 transitions, 368 flow [2022-12-11 18:55:55,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 121 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 18:55:55,548 INFO L231 Difference]: Finished difference. Result has 106 places, 77 transitions, 182 flow [2022-12-11 18:55:55,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=182, PETRI_PLACES=106, PETRI_TRANSITIONS=77} [2022-12-11 18:55:55,549 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 12 predicate places. [2022-12-11 18:55:55,549 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 77 transitions, 182 flow [2022-12-11 18:55:55,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 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-11 18:55:55,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:55,550 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-11 18:55:55,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 18:55:55,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash -959568265, now seen corresponding path program 1 times [2022-12-11 18:55:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:55,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323493444] [2022-12-11 18:55:55,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:55,814 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-11 18:55:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:55,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323493444] [2022-12-11 18:55:55,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323493444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:55,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:55,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:55:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241604273] [2022-12-11 18:55:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:55:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:55:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:55:55,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2022-12-11 18:55:55,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 77 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 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-11 18:55:55,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:55,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2022-12-11 18:55:55,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:56,056 INFO L130 PetriNetUnfolder]: 109/318 cut-off events. [2022-12-11 18:55:56,056 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-11 18:55:56,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 318 events. 109/318 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1208 event pairs, 19 based on Foata normal form. 9/313 useless extension candidates. Maximal degree in co-relation 591. Up to 116 conditions per place. [2022-12-11 18:55:56,058 INFO L137 encePairwiseOnDemand]: 85/91 looper letters, 23 selfloop transitions, 2 changer transitions 25/108 dead transitions. [2022-12-11 18:55:56,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 108 transitions, 367 flow [2022-12-11 18:55:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 18:55:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 18:55:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 655 transitions. [2022-12-11 18:55:56,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7997557997557998 [2022-12-11 18:55:56,061 INFO L175 Difference]: Start difference. First operand has 106 places, 77 transitions, 182 flow. Second operand 9 states and 655 transitions. [2022-12-11 18:55:56,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 108 transitions, 367 flow [2022-12-11 18:55:56,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 108 transitions, 329 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-11 18:55:56,065 INFO L231 Difference]: Finished difference. Result has 98 places, 77 transitions, 182 flow [2022-12-11 18:55:56,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=182, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2022-12-11 18:55:56,066 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2022-12-11 18:55:56,067 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 77 transitions, 182 flow [2022-12-11 18:55:56,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 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-11 18:55:56,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:56,067 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-11 18:55:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 18:55:56,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1080068536, now seen corresponding path program 1 times [2022-12-11 18:55:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:56,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854767175] [2022-12-11 18:55:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:56,309 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-11 18:55:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854767175] [2022-12-11 18:55:56,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854767175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:56,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:56,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 18:55:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934342882] [2022-12-11 18:55:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:56,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 18:55:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 18:55:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 18:55:56,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-11 18:55:56,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 77 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-11 18:55:56,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:56,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-11 18:55:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:56,537 INFO L130 PetriNetUnfolder]: 155/434 cut-off events. [2022-12-11 18:55:56,537 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-11 18:55:56,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 434 events. 155/434 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2113 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 789. Up to 79 conditions per place. [2022-12-11 18:55:56,540 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 24 selfloop transitions, 5 changer transitions 40/129 dead transitions. [2022-12-11 18:55:56,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 129 transitions, 433 flow [2022-12-11 18:55:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:55:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:55:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 771 transitions. [2022-12-11 18:55:56,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8472527472527472 [2022-12-11 18:55:56,543 INFO L175 Difference]: Start difference. First operand has 98 places, 77 transitions, 182 flow. Second operand 10 states and 771 transitions. [2022-12-11 18:55:56,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 129 transitions, 433 flow [2022-12-11 18:55:56,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 129 transitions, 417 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-11 18:55:56,546 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 208 flow [2022-12-11 18:55:56,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=208, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2022-12-11 18:55:56,546 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2022-12-11 18:55:56,547 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 208 flow [2022-12-11 18:55:56,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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-11 18:55:56,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:56,547 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, 1, 1] [2022-12-11 18:55:56,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 18:55:56,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -985322059, now seen corresponding path program 1 times [2022-12-11 18:55:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:56,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754715402] [2022-12-11 18:55:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:56,797 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-11 18:55:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:56,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754715402] [2022-12-11 18:55:56,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754715402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:56,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:56,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:55:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372961158] [2022-12-11 18:55:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:55:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:55:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:55:56,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-11 18:55:56,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 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-11 18:55:56,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:56,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-11 18:55:56,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:56,973 INFO L130 PetriNetUnfolder]: 33/165 cut-off events. [2022-12-11 18:55:56,973 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-11 18:55:56,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 165 events. 33/165 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 429 event pairs, 7 based on Foata normal form. 7/170 useless extension candidates. Maximal degree in co-relation 349. Up to 26 conditions per place. [2022-12-11 18:55:56,974 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 16 selfloop transitions, 7 changer transitions 19/102 dead transitions. [2022-12-11 18:55:56,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 388 flow [2022-12-11 18:55:56,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 18:55:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 18:55:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 744 transitions. [2022-12-11 18:55:56,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8175824175824176 [2022-12-11 18:55:56,978 INFO L175 Difference]: Start difference. First operand has 99 places, 78 transitions, 208 flow. Second operand 10 states and 744 transitions. [2022-12-11 18:55:56,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 388 flow [2022-12-11 18:55:56,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 342 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-11 18:55:56,983 INFO L231 Difference]: Finished difference. Result has 101 places, 78 transitions, 216 flow [2022-12-11 18:55:56,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=101, PETRI_TRANSITIONS=78} [2022-12-11 18:55:56,985 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2022-12-11 18:55:56,985 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 78 transitions, 216 flow [2022-12-11 18:55:56,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 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-11 18:55:56,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:56,986 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, 1, 1, 1, 1, 1] [2022-12-11 18:55:56,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 18:55:56,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 34892079, now seen corresponding path program 1 times [2022-12-11 18:55:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:56,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789779590] [2022-12-11 18:55:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:57,293 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-11 18:55:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:57,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789779590] [2022-12-11 18:55:57,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789779590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:57,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:57,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:55:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222544347] [2022-12-11 18:55:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:57,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:55:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:55:57,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:55:57,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2022-12-11 18:55:57,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 78 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 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-11 18:55:57,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:57,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2022-12-11 18:55:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:57,459 INFO L130 PetriNetUnfolder]: 18/156 cut-off events. [2022-12-11 18:55:57,460 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-11 18:55:57,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 156 events. 18/156 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 354 event pairs, 6 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 264. Up to 40 conditions per place. [2022-12-11 18:55:57,461 INFO L137 encePairwiseOnDemand]: 79/91 looper letters, 21 selfloop transitions, 8 changer transitions 5/91 dead transitions. [2022-12-11 18:55:57,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 91 transitions, 312 flow [2022-12-11 18:55:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 18:55:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 18:55:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 555 transitions. [2022-12-11 18:55:57,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7623626373626373 [2022-12-11 18:55:57,463 INFO L175 Difference]: Start difference. First operand has 101 places, 78 transitions, 216 flow. Second operand 8 states and 555 transitions. [2022-12-11 18:55:57,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 91 transitions, 312 flow [2022-12-11 18:55:57,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 266 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-12-11 18:55:57,468 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 213 flow [2022-12-11 18:55:57,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2022-12-11 18:55:57,470 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 2 predicate places. [2022-12-11 18:55:57,470 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 213 flow [2022-12-11 18:55:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 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-11 18:55:57,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:57,471 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, 1, 1, 1, 1, 1] [2022-12-11 18:55:57,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 18:55:57,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1271943249, now seen corresponding path program 2 times [2022-12-11 18:55:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:57,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544944325] [2022-12-11 18:55:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:59,217 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-11 18:55:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:59,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544944325] [2022-12-11 18:55:59,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544944325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:59,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:59,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 18:55:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056435430] [2022-12-11 18:55:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:59,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 18:55:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 18:55:59,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-11 18:55:59,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2022-12-11 18:55:59,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 213 flow. Second operand has 14 states, 14 states have (on average 63.714285714285715) internal successors, (892), 14 states have internal predecessors, (892), 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-11 18:55:59,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:59,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2022-12-11 18:55:59,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:59,493 INFO L130 PetriNetUnfolder]: 9/147 cut-off events. [2022-12-11 18:55:59,493 INFO L131 PetriNetUnfolder]: For 12/15 co-relation queries the response was YES. [2022-12-11 18:55:59,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 147 events. 9/147 cut-off events. For 12/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 335 event pairs, 1 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 243. Up to 14 conditions per place. [2022-12-11 18:55:59,494 INFO L137 encePairwiseOnDemand]: 79/91 looper letters, 18 selfloop transitions, 7 changer transitions 9/90 dead transitions. [2022-12-11 18:55:59,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 90 transitions, 315 flow [2022-12-11 18:55:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 18:55:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 18:55:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 839 transitions. [2022-12-11 18:55:59,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7092138630600169 [2022-12-11 18:55:59,496 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 213 flow. Second operand 13 states and 839 transitions. [2022-12-11 18:55:59,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 90 transitions, 315 flow [2022-12-11 18:55:59,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 90 transitions, 296 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-11 18:55:59,499 INFO L231 Difference]: Finished difference. Result has 105 places, 81 transitions, 225 flow [2022-12-11 18:55:59,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=225, PETRI_PLACES=105, PETRI_TRANSITIONS=81} [2022-12-11 18:55:59,499 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2022-12-11 18:55:59,500 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 225 flow [2022-12-11 18:55:59,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 63.714285714285715) internal successors, (892), 14 states have internal predecessors, (892), 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-11 18:55:59,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 18:55:59,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 18:55:59,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1350995757, now seen corresponding path program 3 times [2022-12-11 18:55:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:59,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257507601] [2022-12-11 18:55:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 18:55:59,724 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-11 18:55:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 18:55:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257507601] [2022-12-11 18:55:59,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257507601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 18:55:59,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 18:55:59,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 18:55:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284972445] [2022-12-11 18:55:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 18:55:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 18:55:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 18:55:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 18:55:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 18:55:59,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2022-12-11 18:55:59,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 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-11 18:55:59,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 18:55:59,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2022-12-11 18:55:59,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 18:55:59,859 INFO L130 PetriNetUnfolder]: 16/174 cut-off events. [2022-12-11 18:55:59,859 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-11 18:55:59,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 174 events. 16/174 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 497 event pairs, 1 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 329. Up to 35 conditions per place. [2022-12-11 18:55:59,860 INFO L137 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 1 changer transitions 14/92 dead transitions. [2022-12-11 18:55:59,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 92 transitions, 335 flow [2022-12-11 18:55:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 18:55:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 18:55:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 508 transitions. [2022-12-11 18:55:59,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7974882260596546 [2022-12-11 18:55:59,862 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 225 flow. Second operand 7 states and 508 transitions. [2022-12-11 18:55:59,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 92 transitions, 335 flow [2022-12-11 18:55:59,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 302 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-12-11 18:55:59,865 INFO L231 Difference]: Finished difference. Result has 100 places, 78 transitions, 194 flow [2022-12-11 18:55:59,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=100, PETRI_TRANSITIONS=78} [2022-12-11 18:55:59,865 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2022-12-11 18:55:59,865 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 78 transitions, 194 flow [2022-12-11 18:55:59,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.57142857142857) internal successors, (494), 7 states have internal predecessors, (494), 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-11 18:55:59,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 18:55:59,866 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, 1, 1, 1, 1, 1] [2022-12-11 18:55:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 18:55:59,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 18:55:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 18:55:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -925308031, now seen corresponding path program 4 times [2022-12-11 18:55:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 18:55:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101922016] [2022-12-11 18:55:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 18:55:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 18:55:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:55:59,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 18:55:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 18:55:59,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 18:55:59,957 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 18:55:59,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 18:55:59,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-11 18:55:59,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 18:55:59,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 18:55:59,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-11 18:55:59,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 18:55:59,960 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-12-11 18:55:59,964 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 18:55:59,964 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 18:56:00,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 06:56:00 BasicIcfg [2022-12-11 18:56:00,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 18:56:00,032 INFO L158 Benchmark]: Toolchain (without parser) took 7682.79ms. Allocated memory was 174.1MB in the beginning and 341.8MB in the end (delta: 167.8MB). Free memory was 149.1MB in the beginning and 228.3MB in the end (delta: -79.2MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,032 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 18:56:00,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.91ms. Allocated memory is still 174.1MB. Free memory was 149.1MB in the beginning and 123.1MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.08ms. Allocated memory is still 174.1MB. Free memory was 122.5MB in the beginning and 119.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,033 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 174.1MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,034 INFO L158 Benchmark]: RCFGBuilder took 689.44ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 83.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,034 INFO L158 Benchmark]: TraceAbstraction took 6244.26ms. Allocated memory was 212.9MB in the beginning and 341.8MB in the end (delta: 129.0MB). Free memory was 188.2MB in the beginning and 228.3MB in the end (delta: -40.1MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. [2022-12-11 18:56:00,036 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.91ms. Allocated memory is still 174.1MB. Free memory was 149.1MB in the beginning and 123.1MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.08ms. Allocated memory is still 174.1MB. Free memory was 122.5MB in the beginning and 119.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 174.1MB. Free memory was 119.9MB in the beginning and 118.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 689.44ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 83.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6244.26ms. Allocated memory was 212.9MB in the beginning and 341.8MB in the end (delta: 129.0MB). Free memory was 188.2MB in the beginning and 228.3MB in the end (delta: -40.1MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L723] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L826] 0 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L828] 0 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 366 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 78 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 517 ConstructedInterpolants, 0 QuantifiedInterpolants, 2771 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 18:56:00,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...