/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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:35:44,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:35:44,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:35:44,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:35:44,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:35:44,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:35:44,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:35:44,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:35:44,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:35:44,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:35:44,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:35:44,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:35:44,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:35:44,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:35:44,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:35:44,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:35:44,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:35:44,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:35:44,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:35:44,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:35:44,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:35:44,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:35:44,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:35:44,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:35:44,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:35:44,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:35:44,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:35:44,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:35:44,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:35:44,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:35:44,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:35:44,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:35:44,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:35:44,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:35:44,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:35:44,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:35:44,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:35:44,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:35:44,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:35:44,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:35:44,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:35:44,438 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-05 18:35:44,463 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:35:44,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:35:44,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:35:44,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:35:44,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:35:44,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:35:44,466 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:35:44,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:35:44,466 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:35:44,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:35:44,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:35:44,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:35:44,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:35:44,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:35:44,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:35:44,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:35:44,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:35:44,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:35:44,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:35:44,469 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-05 18:35:44,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:35:44,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:35:44,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:35:44,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:35:44,802 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:35:44,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:35:46,026 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:35:46,227 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:35:46,227 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:35:46,237 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e7fddfe/3d2dd26ee48946a986f7d26af7cf26d1/FLAGd9d56882d [2022-12-05 18:35:46,254 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e7fddfe/3d2dd26ee48946a986f7d26af7cf26d1 [2022-12-05 18:35:46,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:35:46,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:35:46,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:35:46,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:35:46,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:35:46,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc64ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46, skipping insertion in model container [2022-12-05 18:35:46,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:35:46,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:35:46,464 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:35:46,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:35:46,684 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:35:46,695 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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 18:35:46,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:35:46,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:35:46,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:35:46,785 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:35:46,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46 WrapperNode [2022-12-05 18:35:46,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:35:46,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:35:46,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:35:46,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:35:46,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,824 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-05 18:35:46,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:35:46,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:35:46,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:35:46,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:35:46,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:35:46,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:35:46,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:35:46,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:35:46,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (1/1) ... [2022-12-05 18:35:46,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:35:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:35:46,872 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-05 18:35:46,895 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-05 18:35:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:35:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:35:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:35:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:35:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:35:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:35:46,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:35:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:35:46,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:35:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:35:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:35:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:35:46,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:35:46,923 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:35:47,049 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:35:47,051 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:35:47,319 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:35:47,403 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:35:47,404 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:35:47,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:35:47 BoogieIcfgContainer [2022-12-05 18:35:47,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:35:47,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:35:47,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:35:47,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:35:47,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:35:46" (1/3) ... [2022-12-05 18:35:47,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642e26a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:35:47, skipping insertion in model container [2022-12-05 18:35:47,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:35:46" (2/3) ... [2022-12-05 18:35:47,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642e26a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:35:47, skipping insertion in model container [2022-12-05 18:35:47,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:35:47" (3/3) ... [2022-12-05 18:35:47,414 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 18:35:47,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:35:47,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:35:47,428 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:35:47,469 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:35:47,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 18:35:47,545 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 18:35:47,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:35:47,550 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 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 18:35:47,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 18:35:47,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-05 18:35:47,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:35:47,570 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;@5af7b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:35:47,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 18:35:47,588 INFO L130 PetriNetUnfolder]: 0/54 cut-off events. [2022-12-05 18:35:47,589 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:35:47,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:47,590 INFO L213 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] [2022-12-05 18:35:47,591 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-05 18:35:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash 333099883, now seen corresponding path program 1 times [2022-12-05 18:35:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:47,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472910253] [2022-12-05 18:35:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:48,066 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-05 18:35:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:48,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472910253] [2022-12-05 18:35:48,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472910253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:48,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:35:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941264150] [2022-12-05 18:35:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:35:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:48,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:35:48,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:35:48,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2022-12-05 18:35:48,100 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-05 18:35:48,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:48,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2022-12-05 18:35:48,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:48,191 INFO L130 PetriNetUnfolder]: 17/164 cut-off events. [2022-12-05 18:35:48,192 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 18:35:48,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 164 events. 17/164 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 467 event pairs, 3 based on Foata normal form. 9/166 useless extension candidates. Maximal degree in co-relation 166. Up to 27 conditions per place. [2022-12-05 18:35:48,201 INFO L137 encePairwiseOnDemand]: 86/91 looper letters, 9 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2022-12-05 18:35:48,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 204 flow [2022-12-05 18:35:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:35:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:35:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2022-12-05 18:35:48,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2022-12-05 18:35:48,217 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 253 transitions. [2022-12-05 18:35:48,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 204 flow [2022-12-05 18:35:48,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:35:48,223 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 178 flow [2022-12-05 18:35:48,225 INFO L276 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-05 18:35:48,229 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2022-12-05 18:35:48,229 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 178 flow [2022-12-05 18:35:48,230 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-05 18:35:48,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:48,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:35:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:35:48,231 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-05 18:35:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1477242433, now seen corresponding path program 1 times [2022-12-05 18:35:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:48,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614991929] [2022-12-05 18:35:48,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:48,565 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-05 18:35:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:48,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614991929] [2022-12-05 18:35:48,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614991929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:48,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:48,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:35:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372555205] [2022-12-05 18:35:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:35:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:35:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:35:48,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2022-12-05 18:35:48,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-05 18:35:48,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:48,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2022-12-05 18:35:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:48,803 INFO L130 PetriNetUnfolder]: 84/353 cut-off events. [2022-12-05 18:35:48,804 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 18:35:48,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 353 events. 84/353 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1762 event pairs, 18 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 498. Up to 65 conditions per place. [2022-12-05 18:35:48,809 INFO L137 encePairwiseOnDemand]: 85/91 looper letters, 14 selfloop transitions, 2 changer transitions 32/111 dead transitions. [2022-12-05 18:35:48,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 318 flow [2022-12-05 18:35:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:35:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:35:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 691 transitions. [2022-12-05 18:35:48,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8437118437118437 [2022-12-05 18:35:48,815 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 178 flow. Second operand 9 states and 691 transitions. [2022-12-05 18:35:48,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 318 flow [2022-12-05 18:35:48,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:35:48,818 INFO L231 Difference]: Finished difference. Result has 105 places, 77 transitions, 178 flow [2022-12-05 18:35:48,818 INFO L276 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=9, PETRI_FLOW=178, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2022-12-05 18:35:48,819 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2022-12-05 18:35:48,819 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 178 flow [2022-12-05 18:35:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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-05 18:35:48,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:48,820 INFO L213 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-05 18:35:48,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:35:48,820 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-05 18:35:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1153324002, now seen corresponding path program 1 times [2022-12-05 18:35:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:48,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930420110] [2022-12-05 18:35:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:49,381 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-05 18:35:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930420110] [2022-12-05 18:35:49,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930420110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:49,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:49,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-05 18:35:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664965008] [2022-12-05 18:35:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 18:35:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 18:35:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-05 18:35:49,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2022-12-05 18:35:49,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 178 flow. Second operand has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 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-05 18:35:49,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:49,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2022-12-05 18:35:49,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:49,622 INFO L130 PetriNetUnfolder]: 66/256 cut-off events. [2022-12-05 18:35:49,622 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-05 18:35:49,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 256 events. 66/256 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1018 event pairs, 25 based on Foata normal form. 6/256 useless extension candidates. Maximal degree in co-relation 442. Up to 85 conditions per place. [2022-12-05 18:35:49,624 INFO L137 encePairwiseOnDemand]: 79/91 looper letters, 16 selfloop transitions, 9 changer transitions 22/106 dead transitions. [2022-12-05 18:35:49,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 350 flow [2022-12-05 18:35:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:35:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:35:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1001 transitions. [2022-12-05 18:35:49,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2022-12-05 18:35:49,626 INFO L175 Difference]: Start difference. First operand has 105 places, 77 transitions, 178 flow. Second operand 14 states and 1001 transitions. [2022-12-05 18:35:49,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 350 flow [2022-12-05 18:35:49,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 318 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-05 18:35:49,630 INFO L231 Difference]: Finished difference. Result has 104 places, 81 transitions, 220 flow [2022-12-05 18:35:49,630 INFO L276 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=220, PETRI_PLACES=104, PETRI_TRANSITIONS=81} [2022-12-05 18:35:49,631 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2022-12-05 18:35:49,631 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 81 transitions, 220 flow [2022-12-05 18:35:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 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-05 18:35:49,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:49,632 INFO L213 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] [2022-12-05 18:35:49,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:35:49,632 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-05 18:35:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash -763802275, now seen corresponding path program 1 times [2022-12-05 18:35:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:49,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202307595] [2022-12-05 18:35:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:50,058 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-05 18:35:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202307595] [2022-12-05 18:35:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202307595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:35:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386345924] [2022-12-05 18:35:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:35:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:35:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:35:50,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2022-12-05 18:35:50,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 81 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-05 18:35:50,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:50,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2022-12-05 18:35:50,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:50,437 INFO L130 PetriNetUnfolder]: 234/693 cut-off events. [2022-12-05 18:35:50,437 INFO L131 PetriNetUnfolder]: For 764/764 co-relation queries the response was YES. [2022-12-05 18:35:50,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 693 events. 234/693 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4045 event pairs, 13 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 1513. Up to 173 conditions per place. [2022-12-05 18:35:50,441 INFO L137 encePairwiseOnDemand]: 78/91 looper letters, 46 selfloop transitions, 34 changer transitions 6/143 dead transitions. [2022-12-05 18:35:50,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 143 transitions, 620 flow [2022-12-05 18:35:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:35:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:35:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 992 transitions. [2022-12-05 18:35:50,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7786499215070644 [2022-12-05 18:35:50,443 INFO L175 Difference]: Start difference. First operand has 104 places, 81 transitions, 220 flow. Second operand 14 states and 992 transitions. [2022-12-05 18:35:50,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 143 transitions, 620 flow [2022-12-05 18:35:50,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 143 transitions, 606 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-05 18:35:50,447 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 504 flow [2022-12-05 18:35:50,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=504, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2022-12-05 18:35:50,447 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2022-12-05 18:35:50,448 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 504 flow [2022-12-05 18:35:50,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-05 18:35:50,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:50,448 INFO L213 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] [2022-12-05 18:35:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:35:50,448 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-05 18:35:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1301551939, now seen corresponding path program 2 times [2022-12-05 18:35:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:50,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344362044] [2022-12-05 18:35:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:50,574 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-05 18:35:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344362044] [2022-12-05 18:35:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344362044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:50,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:50,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:35:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803828275] [2022-12-05 18:35:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:50,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:35:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:35:50,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:35:50,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-05 18:35:50,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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-05 18:35:50,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:50,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-05 18:35:50,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:50,740 INFO L130 PetriNetUnfolder]: 183/536 cut-off events. [2022-12-05 18:35:50,740 INFO L131 PetriNetUnfolder]: For 1320/1332 co-relation queries the response was YES. [2022-12-05 18:35:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 536 events. 183/536 cut-off events. For 1320/1332 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2790 event pairs, 2 based on Foata normal form. 16/546 useless extension candidates. Maximal degree in co-relation 1663. Up to 94 conditions per place. [2022-12-05 18:35:50,743 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 31 selfloop transitions, 10 changer transitions 64/167 dead transitions. [2022-12-05 18:35:50,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 167 transitions, 1052 flow [2022-12-05 18:35:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:35:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:35:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 764 transitions. [2022-12-05 18:35:50,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8395604395604396 [2022-12-05 18:35:50,745 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 504 flow. Second operand 10 states and 764 transitions. [2022-12-05 18:35:50,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 167 transitions, 1052 flow [2022-12-05 18:35:50,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 167 transitions, 956 flow, removed 47 selfloop flow, removed 1 redundant places. [2022-12-05 18:35:50,752 INFO L231 Difference]: Finished difference. Result has 127 places, 96 transitions, 378 flow [2022-12-05 18:35:50,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=127, PETRI_TRANSITIONS=96} [2022-12-05 18:35:50,752 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 33 predicate places. [2022-12-05 18:35:50,752 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 96 transitions, 378 flow [2022-12-05 18:35:50,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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-05 18:35:50,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:50,753 INFO L213 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-05 18:35:50,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:35:50,753 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-05 18:35:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 786199438, now seen corresponding path program 1 times [2022-12-05 18:35:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:50,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287189051] [2022-12-05 18:35:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:50,890 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-05 18:35:50,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:50,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287189051] [2022-12-05 18:35:50,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287189051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:50,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:50,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:35:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428952697] [2022-12-05 18:35:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:50,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:35:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:35:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:35:50,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2022-12-05 18:35:50,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 96 transitions, 378 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-05 18:35:50,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:50,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2022-12-05 18:35:50,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:51,038 INFO L130 PetriNetUnfolder]: 49/253 cut-off events. [2022-12-05 18:35:51,038 INFO L131 PetriNetUnfolder]: For 450/460 co-relation queries the response was YES. [2022-12-05 18:35:51,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 253 events. 49/253 cut-off events. For 450/460 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1002 event pairs, 8 based on Foata normal form. 7/258 useless extension candidates. Maximal degree in co-relation 743. Up to 38 conditions per place. [2022-12-05 18:35:51,040 INFO L137 encePairwiseOnDemand]: 82/91 looper letters, 27 selfloop transitions, 13 changer transitions 15/117 dead transitions. [2022-12-05 18:35:51,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 117 transitions, 616 flow [2022-12-05 18:35:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:35:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:35:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 959 transitions. [2022-12-05 18:35:51,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8106508875739645 [2022-12-05 18:35:51,042 INFO L175 Difference]: Start difference. First operand has 127 places, 96 transitions, 378 flow. Second operand 13 states and 959 transitions. [2022-12-05 18:35:51,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 117 transitions, 616 flow [2022-12-05 18:35:51,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 523 flow, removed 38 selfloop flow, removed 15 redundant places. [2022-12-05 18:35:51,047 INFO L231 Difference]: Finished difference. Result has 125 places, 99 transitions, 396 flow [2022-12-05 18:35:51,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=396, PETRI_PLACES=125, PETRI_TRANSITIONS=99} [2022-12-05 18:35:51,050 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 31 predicate places. [2022-12-05 18:35:51,050 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 99 transitions, 396 flow [2022-12-05 18:35:51,050 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-05 18:35:51,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:51,050 INFO L213 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-05 18:35:51,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:35:51,051 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-05 18:35:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1463789981, now seen corresponding path program 1 times [2022-12-05 18:35:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:51,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763565065] [2022-12-05 18:35:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:35:51,450 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-05 18:35:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:35:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763565065] [2022-12-05 18:35:51,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763565065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:35:51,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:35:51,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:35:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524568884] [2022-12-05 18:35:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:35:51,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:35:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:35:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:35:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:35:51,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 91 [2022-12-05 18:35:51,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 99 transitions, 396 flow. Second operand has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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-05 18:35:51,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:35:51,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 91 [2022-12-05 18:35:51,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:35:51,593 INFO L130 PetriNetUnfolder]: 57/338 cut-off events. [2022-12-05 18:35:51,593 INFO L131 PetriNetUnfolder]: For 399/402 co-relation queries the response was YES. [2022-12-05 18:35:51,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 338 events. 57/338 cut-off events. For 399/402 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1739 event pairs, 10 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 944. Up to 67 conditions per place. [2022-12-05 18:35:51,595 INFO L137 encePairwiseOnDemand]: 83/91 looper letters, 30 selfloop transitions, 3 changer transitions 28/118 dead transitions. [2022-12-05 18:35:51,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 118 transitions, 593 flow [2022-12-05 18:35:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 18:35:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 18:35:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 520 transitions. [2022-12-05 18:35:51,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-05 18:35:51,596 INFO L175 Difference]: Start difference. First operand has 125 places, 99 transitions, 396 flow. Second operand 8 states and 520 transitions. [2022-12-05 18:35:51,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 118 transitions, 593 flow [2022-12-05 18:35:51,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 118 transitions, 556 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-05 18:35:51,600 INFO L231 Difference]: Finished difference. Result has 127 places, 89 transitions, 318 flow [2022-12-05 18:35:51,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=127, PETRI_TRANSITIONS=89} [2022-12-05 18:35:51,601 INFO L294 CegarLoopForPetriNet]: 94 programPoint places, 33 predicate places. [2022-12-05 18:35:51,601 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 89 transitions, 318 flow [2022-12-05 18:35:51,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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-05 18:35:51,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:35:51,601 INFO L213 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-05 18:35:51,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:35:51,601 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-05 18:35:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:35:51,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2030572079, now seen corresponding path program 2 times [2022-12-05 18:35:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:35:51,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958046685] [2022-12-05 18:35:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:35:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:35:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:35:51,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:35:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:35:51,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:35:51,680 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:35:51,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 18:35:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 18:35:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 18:35:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 18:35:51,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 18:35:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:35:51,683 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-12-05 18:35:51,686 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:35:51,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:35:51,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:35:51 BasicIcfg [2022-12-05 18:35:51,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:35:51,737 INFO L158 Benchmark]: Toolchain (without parser) took 5479.64ms. Allocated memory was 209.7MB in the beginning and 379.6MB in the end (delta: 169.9MB). Free memory was 167.7MB in the beginning and 198.0MB in the end (delta: -30.3MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,737 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 100.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:35:51,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.46ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 142.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.71ms. Allocated memory is still 209.7MB. Free memory was 142.0MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,738 INFO L158 Benchmark]: Boogie Preprocessor took 22.98ms. Allocated memory is still 209.7MB. Free memory was 139.4MB in the beginning and 137.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,738 INFO L158 Benchmark]: RCFGBuilder took 558.21ms. Allocated memory is still 209.7MB. Free memory was 137.8MB in the beginning and 106.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,738 INFO L158 Benchmark]: TraceAbstraction took 4328.61ms. Allocated memory was 209.7MB in the beginning and 379.6MB in the end (delta: 169.9MB). Free memory was 105.8MB in the beginning and 198.0MB in the end (delta: -92.2MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. [2022-12-05 18:35:51,739 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.13ms. Allocated memory is still 209.7MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 100.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 525.46ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 142.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.71ms. Allocated memory is still 209.7MB. Free memory was 142.0MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.98ms. Allocated memory is still 209.7MB. Free memory was 139.4MB in the beginning and 137.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 558.21ms. Allocated memory is still 209.7MB. Free memory was 137.8MB in the beginning and 106.3MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4328.61ms. Allocated memory was 209.7MB in the beginning and 379.6MB in the end (delta: 169.9MB). Free memory was 105.8MB in the beginning and 198.0MB in the end (delta: -92.2MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=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] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L732] 0 int y = 0; VAL [__unbuffered_cnt=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] [L734] 0 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0] [L802] 0 pthread_t t1091; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1091={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, z=0] [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-1, t1091={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, z=0] [L804] 0 pthread_t t1092; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1091={5:0}, t1092={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, z=0] [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=0, t1091={5:0}, t1092={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, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 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) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 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 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 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_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=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __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=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 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) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __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=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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, 111 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: 4.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 699 IncrementalHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 66 mSDtfsCounter, 699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=4, InterpolantAutomatonStates: 71, 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.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 1992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 18:35:51,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...