./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:50:04,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:50:04,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:50:04,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:50:04,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:50:04,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:50:04,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:50:04,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:50:04,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:50:04,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:50:04,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:50:04,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:50:04,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:50:04,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:50:04,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:50:04,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:50:04,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:50:04,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:50:04,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:50:04,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:50:04,917 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:50:04,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:50:04,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:50:04,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:50:04,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:50:04,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:50:04,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:50:04,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:50:04,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:50:04,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:50:04,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:50:04,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:50:04,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:50:04,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:50:04,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:50:04,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:50:04,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:50:04,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:50:04,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:50:04,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:50:04,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:50:04,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:50:04,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:50:04,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:50:04,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:50:04,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:50:04,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:50:04,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:50:04,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:50:04,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:50:04,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:50:04,977 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:50:04,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:50:04,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:50:04,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:50:04,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:50:04,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:50:04,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:50:04,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:50:04,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:50:04,979 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:50:04,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:50:04,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:50:04,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:50:04,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:50:04,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:50:04,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:50:04,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:50:04,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:50:04,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:50:04,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:50:04,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:50:04,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:50:04,983 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:50:04,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:50:04,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:50:04,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2022-07-22 14:50:05,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:50:05,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:50:05,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:50:05,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:50:05,250 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:50:05,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-22 14:50:05,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6649fbf6d/339e5242de944cf2ba3ad74c82390d81/FLAGb15f7c44c [2022-07-22 14:50:05,854 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:50:05,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-22 14:50:05,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6649fbf6d/339e5242de944cf2ba3ad74c82390d81/FLAGb15f7c44c [2022-07-22 14:50:06,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6649fbf6d/339e5242de944cf2ba3ad74c82390d81 [2022-07-22 14:50:06,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:50:06,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:50:06,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:50:06,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:50:06,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:50:06,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41693d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06, skipping insertion in model container [2022-07-22 14:50:06,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:50:06,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:50:06,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-22 14:50:06,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-22 14:50:06,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-22 14:50:06,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:50:06,661 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:50:06,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-22 14:50:06,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-22 14:50:06,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-22 14:50:06,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:50:06,766 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:50:06,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06 WrapperNode [2022-07-22 14:50:06,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:50:06,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:50:06,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:50:06,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:50:06,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,832 INFO L137 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2022-07-22 14:50:06,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:50:06,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:50:06,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:50:06,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:50:06,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:50:06,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:50:06,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:50:06,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:50:06,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (1/1) ... [2022-07-22 14:50:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:50:06,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:50:06,929 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-07-22 14:50:06,951 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-07-22 14:50:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-22 14:50:06,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-22 14:50:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-22 14:50:06,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-22 14:50:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:50:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-22 14:50:06,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-22 14:50:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-22 14:50:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:50:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:50:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-22 14:50:06,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-22 14:50:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:50:06,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:50:07,086 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:50:07,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:50:07,372 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:50:07,378 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:50:07,379 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:50:07,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:50:07 BoogieIcfgContainer [2022-07-22 14:50:07,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:50:07,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:50:07,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:50:07,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:50:07,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:50:06" (1/3) ... [2022-07-22 14:50:07,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cabed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:50:07, skipping insertion in model container [2022-07-22 14:50:07,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:06" (2/3) ... [2022-07-22 14:50:07,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5cabed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:50:07, skipping insertion in model container [2022-07-22 14:50:07,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:50:07" (3/3) ... [2022-07-22 14:50:07,388 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-22 14:50:07,401 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:50:07,401 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-22 14:50:07,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:50:07,454 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=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@511c2da7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25df158c [2022-07-22 14:50:07,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-22 14:50:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-22 14:50:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:50:07,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:07,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:07,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2022-07-22 14:50:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:50:07,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587547585] [2022-07-22 14:50:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:50:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:50:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 14:50:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:50:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:50:07,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587547585] [2022-07-22 14:50:07,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587547585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:07,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:50:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514527476] [2022-07-22 14:50:07,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:07,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:50:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:50:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:50:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:50:07,812 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:50:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:07,921 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2022-07-22 14:50:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:50:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-22 14:50:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:07,931 INFO L225 Difference]: With dead ends: 147 [2022-07-22 14:50:07,931 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 14:50:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:50:07,938 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:07,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:50:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 14:50:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-07-22 14:50:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-22 14:50:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-07-22 14:50:07,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2022-07-22 14:50:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:07,996 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-07-22 14:50:07,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:50:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-07-22 14:50:07,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:50:07,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:07,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:07,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:50:08,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2022-07-22 14:50:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:50:08,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454296816] [2022-07-22 14:50:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:50:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:50:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 14:50:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:50:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:50:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454296816] [2022-07-22 14:50:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454296816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:08,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:08,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:50:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390478955] [2022-07-22 14:50:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:08,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:50:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:50:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:50:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:50:08,199 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:08,364 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-07-22 14:50:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:50:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-22 14:50:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:08,366 INFO L225 Difference]: With dead ends: 82 [2022-07-22 14:50:08,367 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 14:50:08,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:50:08,368 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:08,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 166 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:50:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 14:50:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2022-07-22 14:50:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-22 14:50:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-07-22 14:50:08,379 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2022-07-22 14:50:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:08,380 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-07-22 14:50:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-07-22 14:50:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:50:08,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:08,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:08,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:50:08,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:08,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2022-07-22 14:50:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:50:08,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097818295] [2022-07-22 14:50:08,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:50:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:50:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 14:50:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:50:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:50:08,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097818295] [2022-07-22 14:50:08,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097818295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:08,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:08,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:50:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795093732] [2022-07-22 14:50:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:08,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:50:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:50:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:50:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:50:08,525 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:08,993 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2022-07-22 14:50:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 14:50:08,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-22 14:50:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:08,996 INFO L225 Difference]: With dead ends: 206 [2022-07-22 14:50:08,996 INFO L226 Difference]: Without dead ends: 145 [2022-07-22 14:50:08,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:50:08,998 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 136 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:08,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 202 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:50:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-22 14:50:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-07-22 14:50:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2022-07-22 14:50:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2022-07-22 14:50:09,014 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2022-07-22 14:50:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:09,014 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2022-07-22 14:50:09,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2022-07-22 14:50:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 14:50:09,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:09,017 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:09,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:50:09,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2022-07-22 14:50:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:50:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762799780] [2022-07-22 14:50:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:50:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:50:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 14:50:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 14:50:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 14:50:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 14:50:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 14:50:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-22 14:50:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:50:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762799780] [2022-07-22 14:50:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762799780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:50:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819056529] [2022-07-22 14:50:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:09,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:50:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:50:09,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:50:09,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:50:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:50:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 14:50:09,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:09,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819056529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:09,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:50:09,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-22 14:50:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241195827] [2022-07-22 14:50:09,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:09,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:50:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:50:09,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:50:09,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:50:09,389 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 14:50:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:09,410 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2022-07-22 14:50:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:50:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-07-22 14:50:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:09,413 INFO L225 Difference]: With dead ends: 219 [2022-07-22 14:50:09,427 INFO L226 Difference]: Without dead ends: 126 [2022-07-22 14:50:09,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:50:09,429 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:09,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:50:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-22 14:50:09,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-22 14:50:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2022-07-22 14:50:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-07-22 14:50:09,455 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2022-07-22 14:50:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:09,456 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-07-22 14:50:09,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 14:50:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-07-22 14:50:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 14:50:09,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:09,458 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 14:50:09,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:50:09,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:50:09,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2022-07-22 14:50:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:50:09,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289537092] [2022-07-22 14:50:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:50:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 14:50:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 14:50:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 14:50:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 14:50:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 14:50:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 14:50:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 14:50:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 14:50:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:50:10,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289537092] [2022-07-22 14:50:10,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289537092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:50:10,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703964117] [2022-07-22 14:50:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:10,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:50:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:50:10,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:50:10,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:50:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:11,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2022-07-22 14:50:11,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:11,412 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:50:11,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 14:50:11,644 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-22 14:50:11,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 14:50:11,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:50:11,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:50:13,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:50:13,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:50:13,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:50:13,323 INFO L356 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2022-07-22 14:50:13,324 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:50:13,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:50:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:50:13,526 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:50:13,530 INFO L158 Benchmark]: Toolchain (without parser) took 7198.30ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 76.0MB in the beginning and 73.4MB in the end (delta: 2.6MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,530 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:50:13,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.96ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 75.7MB in the beginning and 94.3MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.21ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 91.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,531 INFO L158 Benchmark]: Boogie Preprocessor took 61.43ms. Allocated memory is still 127.9MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,532 INFO L158 Benchmark]: RCFGBuilder took 484.93ms. Allocated memory is still 127.9MB. Free memory was 89.8MB in the beginning and 72.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,532 INFO L158 Benchmark]: TraceAbstraction took 6146.69ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 72.2MB in the beginning and 73.4MB in the end (delta: -1.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-07-22 14:50:13,534 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.20ms. Allocated memory is still 96.5MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.96ms. Allocated memory was 96.5MB in the beginning and 127.9MB in the end (delta: 31.5MB). Free memory was 75.7MB in the beginning and 94.3MB in the end (delta: -18.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.21ms. Allocated memory is still 127.9MB. Free memory was 94.3MB in the beginning and 91.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.43ms. Allocated memory is still 127.9MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.93ms. Allocated memory is still 127.9MB. Free memory was 89.8MB in the beginning and 72.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6146.69ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 72.2MB in the beginning and 73.4MB in the end (delta: -1.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 75 context size 75 output size 75: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:50:13,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:50:15,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:50:15,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:50:15,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:50:15,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:50:15,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:50:15,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:50:15,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:50:15,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:50:15,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:50:15,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:50:15,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:50:15,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:50:15,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:50:15,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:50:15,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:50:15,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:50:15,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:50:15,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:50:15,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:50:15,574 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:50:15,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:50:15,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:50:15,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:50:15,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:50:15,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:50:15,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:50:15,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:50:15,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:50:15,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:50:15,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:50:15,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:50:15,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:50:15,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:50:15,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:50:15,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:50:15,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:50:15,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:50:15,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:50:15,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:50:15,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:50:15,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:50:15,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:50:15,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:50:15,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:50:15,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:50:15,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:50:15,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:50:15,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:50:15,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:50:15,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:50:15,642 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:50:15,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:50:15,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:50:15,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:50:15,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:50:15,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:50:15,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:50:15,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:50:15,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:50:15,644 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:50:15,645 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:50:15,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:50:15,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:50:15,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:50:15,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:50:15,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:50:15,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:50:15,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:50:15,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:50:15,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:50:15,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:50:15,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:50:15,647 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:50:15,647 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:50:15,647 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:50:15,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:50:15,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:50:15,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:50:15,648 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2022-07-22 14:50:15,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:50:15,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:50:15,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:50:15,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:50:15,982 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:50:15,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-22 14:50:16,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc60be18/1641c1bd7fa042b9b1b9f7c846f55cba/FLAG29e2bed78 [2022-07-22 14:50:16,561 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:50:16,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2022-07-22 14:50:16,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc60be18/1641c1bd7fa042b9b1b9f7c846f55cba/FLAG29e2bed78 [2022-07-22 14:50:17,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc60be18/1641c1bd7fa042b9b1b9f7c846f55cba [2022-07-22 14:50:17,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:50:17,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:50:17,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:50:17,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:50:17,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:50:17,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612b7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17, skipping insertion in model container [2022-07-22 14:50:17,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:50:17,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:50:17,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-22 14:50:17,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-22 14:50:17,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-22 14:50:17,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:50:17,417 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 14:50:17,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:50:17,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-22 14:50:17,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-22 14:50:17,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-22 14:50:17,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:50:17,497 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:50:17,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2022-07-22 14:50:17,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2022-07-22 14:50:17,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2022-07-22 14:50:17,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:50:17,587 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:50:17,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17 WrapperNode [2022-07-22 14:50:17,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:50:17,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:50:17,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:50:17,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:50:17,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,660 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2022-07-22 14:50:17,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:50:17,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:50:17,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:50:17,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:50:17,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:50:17,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:50:17,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:50:17,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:50:17,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (1/1) ... [2022-07-22 14:50:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:50:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:50:17,765 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-07-22 14:50:17,777 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-07-22 14:50:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-22 14:50:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-22 14:50:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-22 14:50:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-22 14:50:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:50:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-22 14:50:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-22 14:50:17,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:50:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:50:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:50:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-22 14:50:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-22 14:50:17,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:50:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:50:17,957 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:50:17,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:50:18,243 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:50:18,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:50:18,251 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:50:18,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:50:18 BoogieIcfgContainer [2022-07-22 14:50:18,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:50:18,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:50:18,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:50:18,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:50:18,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:50:17" (1/3) ... [2022-07-22 14:50:18,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8960439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:50:18, skipping insertion in model container [2022-07-22 14:50:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:50:17" (2/3) ... [2022-07-22 14:50:18,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8960439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:50:18, skipping insertion in model container [2022-07-22 14:50:18,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:50:18" (3/3) ... [2022-07-22 14:50:18,259 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2022-07-22 14:50:18,279 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:50:18,280 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-22 14:50:18,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:50:18,324 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=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f288482, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18bdf00f [2022-07-22 14:50:18,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-22 14:50:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-22 14:50:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:50:18,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:18,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:18,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2022-07-22 14:50:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847546409] [2022-07-22 14:50:18,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:18,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:18,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:50:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:18,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:50:18,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:50:18,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:18,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:50:18,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847546409] [2022-07-22 14:50:18,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847546409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:18,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:18,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:50:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790422269] [2022-07-22 14:50:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:18,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:50:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:50:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:50:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:50:18,617 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:50:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:18,655 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-22 14:50:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:50:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-22 14:50:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:18,665 INFO L225 Difference]: With dead ends: 130 [2022-07-22 14:50:18,665 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 14:50:18,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:50:18,683 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:18,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:50:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 14:50:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-22 14:50:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-22 14:50:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-22 14:50:18,732 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2022-07-22 14:50:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:18,732 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-22 14:50:18,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 14:50:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-22 14:50:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:50:18,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:18,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:18,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:50:18,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:50:18,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2022-07-22 14:50:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:18,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966085772] [2022-07-22 14:50:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:18,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:18,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:50:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:19,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 14:50:19,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:50:19,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:19,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:50:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966085772] [2022-07-22 14:50:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966085772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:19,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:50:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975306491] [2022-07-22 14:50:19,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:19,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:50:19,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:50:19,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:50:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:50:19,463 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:19,850 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-07-22 14:50:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:50:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-22 14:50:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:19,854 INFO L225 Difference]: With dead ends: 170 [2022-07-22 14:50:19,854 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 14:50:19,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:50:19,856 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:19,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 14:50:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 14:50:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2022-07-22 14:50:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-22 14:50:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-22 14:50:19,882 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2022-07-22 14:50:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:19,882 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-22 14:50:19,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-22 14:50:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:50:19,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:19,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:19,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:50:20,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:50:20,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2022-07-22 14:50:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970749774] [2022-07-22 14:50:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:20,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:20,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:20,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:20,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:50:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:20,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:50:20,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 14:50:20,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:20,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:50:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970749774] [2022-07-22 14:50:20,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970749774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:20,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:20,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:50:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415322084] [2022-07-22 14:50:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:20,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:50:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:50:20,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:50:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:50:20,210 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:20,240 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-07-22 14:50:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:50:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-22 14:50:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:20,246 INFO L225 Difference]: With dead ends: 108 [2022-07-22 14:50:20,246 INFO L226 Difference]: Without dead ends: 106 [2022-07-22 14:50:20,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:50:20,248 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:20,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:50:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-22 14:50:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-07-22 14:50:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-22 14:50:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-22 14:50:20,274 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2022-07-22 14:50:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:20,275 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-22 14:50:20,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-22 14:50:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-22 14:50:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 14:50:20,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:20,277 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:20,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:50:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:50:20,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2022-07-22 14:50:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712922952] [2022-07-22 14:50:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:20,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:20,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:20,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:20,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:50:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:20,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 14:50:20,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:20,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:50:20,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:50:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 14:50:21,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:21,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:50:21,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712922952] [2022-07-22 14:50:21,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712922952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:21,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:21,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 14:50:21,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77964681] [2022-07-22 14:50:21,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:21,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:50:21,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:50:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:50:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:50:21,141 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 14:50:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:22,648 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-07-22 14:50:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 14:50:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2022-07-22 14:50:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:22,652 INFO L225 Difference]: With dead ends: 268 [2022-07-22 14:50:22,652 INFO L226 Difference]: Without dead ends: 162 [2022-07-22 14:50:22,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-22 14:50:22,653 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 241 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:22,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 312 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-22 14:50:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-22 14:50:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2022-07-22 14:50:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2022-07-22 14:50:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-22 14:50:22,666 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2022-07-22 14:50:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:22,667 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-22 14:50:22,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 14:50:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-22 14:50:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 14:50:22,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:22,669 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:50:22,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-22 14:50:22,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:50:22,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2022-07-22 14:50:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:22,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015890766] [2022-07-22 14:50:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:22,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:22,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:22,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:22,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:50:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:23,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:50:23,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 14:50:23,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:50:23,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:50:23,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015890766] [2022-07-22 14:50:23,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015890766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:50:23,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:50:23,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:50:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524668670] [2022-07-22 14:50:23,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:50:23,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:50:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:50:23,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:50:23,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:50:23,040 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 14:50:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:50:23,078 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2022-07-22 14:50:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:50:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2022-07-22 14:50:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:50:23,081 INFO L225 Difference]: With dead ends: 196 [2022-07-22 14:50:23,081 INFO L226 Difference]: Without dead ends: 109 [2022-07-22 14:50:23,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:50:23,082 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:50:23,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:50:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-22 14:50:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-07-22 14:50:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 14:50:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-07-22 14:50:23,103 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2022-07-22 14:50:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:50:23,104 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-07-22 14:50:23,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 14:50:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-07-22 14:50:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 14:50:23,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:50:23,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-22 14:50:23,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:50:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:50:23,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:50:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:50:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2022-07-22 14:50:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:50:23,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973577753] [2022-07-22 14:50:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:50:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:50:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:50:23,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:50:23,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:50:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:50:23,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-22 14:50:23,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:50:23,752 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 14:50:23,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-22 14:50:23,932 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-22 14:50:23,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:50:24,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-22 14:50:24,784 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 14:50:24,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-22 14:50:24,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:50:24,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:50:24,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 14:50:25,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:50:25,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:50:25,254 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-22 14:50:25,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 116 [2022-07-22 14:50:25,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:50:25,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:50:25,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:50:25,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-07-22 14:50:25,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:50:27,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-22 14:50:30,628 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (= (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)))) (or (and (exists ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_4 |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|) (= (store (let ((.cse0 (store (select |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|))) (store (store |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base| .cse0) (select .cse0 |c_~#mutexes~0.offset|) v_ArrVal_87)) |c_~#mutexes~0.base| v_arrayElimArr_4) |c_#memory_$Pointer$.base|))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (let ((.cse1 (select (store (select |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|) |c_~#mutexes~0.offset|))) (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_DerPreprocessor_4) |c_~#mutexes~0.base| v_DerPreprocessor_5) .cse1 v_DerPreprocessor_4) |c_~#mutexes~0.base| v_DerPreprocessor_5) .cse1)) v_DerPreprocessor_4) (= (_ bv4 32) (select v_DerPreprocessor_5 |c_~#mutexes~0.offset|)))) .cse2 (= (select (store (select |c_old(#memory_$Pointer$.base)| |c_~#mutexes~0.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.base|)) (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse4 (select (select .cse3 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse3 .cse4 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse4) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse3 .cse4 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (not (= .cse4 |c_~#mutexes~0.base|)) (not (= |c_~#mutexes~0.base| |mutex_lock_ldv_list_add_~new#1.base|)))))) .cse2) (and (or (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse6 (select (select .cse5 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse5 .cse6 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse5 .cse6 (store (select .cse5 .cse6) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse6) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse5 .cse6 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (not (= .cse6 |c_~#mutexes~0.base|)) (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store (let ((.cse13 (select (select (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse13 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse13 v_DerPreprocessor_7)) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) |mutex_lock_ldv_list_add_~new#1.base|))) (and (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) .cse7) (= v_DerPreprocessor_8 .cse7) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse12 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_1) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_2) |c_~#mutexes~0.base| v_DerPreprocessor_3))) (let ((.cse10 (select .cse12 .cse9)) (.cse8 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse9 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9)) (.cse11 (select .cse12 |mutex_lock_ldv_list_add_~new#1.base|))) (and (= (select .cse8 .cse9) .cse10) (= (select |c_#memory_$Pointer$.offset| .cse9) .cse10) (= .cse11 (select .cse8 |mutex_lock_ldv_list_add_~new#1.base|)) (= .cse11 v_DerPreprocessor_2))))))))) (= (_ bv4 32) (select v_DerPreprocessor_9 |c_~#mutexes~0.offset|)))))))) (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse14 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse15 (select (select .cse14 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store (store .cse14 .cse15 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse14 .cse15 (store (select .cse14 .cse15) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse15) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse14 .cse15 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (not (= .cse15 |c_~#mutexes~0.base|)) (exists ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= v_DerPreprocessor_8 (select (store (store (let ((.cse16 (select (select (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse16 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse16 v_DerPreprocessor_7)) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) |mutex_lock_ldv_list_add_~new#1.base|)) (exists ((v_prenex_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse19 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse17 v_prenex_18) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_19) |c_~#mutexes~0.base| v_prenex_20) .cse17 v_prenex_18) |mutex_lock_ldv_list_add_~new#1.base| v_prenex_19) |c_~#mutexes~0.base| v_prenex_20))) (let ((.cse18 (select .cse19 .cse17))) (and (= (select |c_#memory_$Pointer$.offset| .cse17) .cse18) (= (_ bv4 32) (select v_prenex_20 |c_~#mutexes~0.offset|)) (= (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse17 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse17 v_DerPreprocessor_7) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_8) |c_~#mutexes~0.base| v_DerPreprocessor_9) .cse17) .cse18) (= v_prenex_19 (select .cse19 |mutex_lock_ldv_list_add_~new#1.base|))))))))) (= (_ bv4 32) (select v_DerPreprocessor_9 |c_~#mutexes~0.offset|))))))))) .cse2) (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_77 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32))) (|mutex_lock_ldv_list_add_~new#1.base| (_ BitVec 32)) (__ldv_list_add_~next.offset (_ BitVec 32))) (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base| (store (select |c_old(#memory_$Pointer$.base)| |mutex_lock_ldv_list_add_~new#1.base|) (_ bv0 32) |c_mutex_lock_#in~m#1.base|)))) (let ((.cse21 (select (select .cse20 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse22 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse21 v_DerPreprocessor_13) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_14) |c_~#mutexes~0.base| v_DerPreprocessor_15) .cse21 v_DerPreprocessor_13) |mutex_lock_ldv_list_add_~new#1.base| v_DerPreprocessor_14) |c_~#mutexes~0.base| v_DerPreprocessor_15))) (and (= (_ bv4 32) (select v_DerPreprocessor_15 |c_~#mutexes~0.offset|)) (= |c_#memory_$Pointer$.base| (store (store (store .cse20 .cse21 v_ArrVal_87) |mutex_lock_ldv_list_add_~new#1.base| (store (store (select (store .cse20 .cse21 (store (select .cse20 .cse21) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |mutex_lock_ldv_list_add_~new#1.base|)) |mutex_lock_ldv_list_add_~new#1.base|) (_ bv4 32) .cse21) (_ bv8 32) |c_~#mutexes~0.base|)) |c_~#mutexes~0.base| (store (select (store (store .cse20 .cse21 v_ArrVal_91) |mutex_lock_ldv_list_add_~new#1.base| v_ArrVal_77) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |mutex_lock_ldv_list_add_~new#1.base|))) (= .cse21 |c_~#mutexes~0.base|) (= v_DerPreprocessor_13 (select .cse22 .cse21)) (= (select |c_#memory_$Pointer$.offset| |mutex_lock_ldv_list_add_~new#1.base|) (select .cse22 |mutex_lock_ldv_list_add_~new#1.base|))))))) .cse2))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from false [2022-07-22 14:50:34,731 INFO L173 IndexEqualityManager]: detected equality via solver