./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 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_lock.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 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:52:35,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:52:35,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:52:35,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:52:35,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:52:35,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:52:35,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:52:35,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:52:36,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:52:36,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:52:36,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:52:36,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:52:36,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:52:36,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:52:36,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:52:36,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:52:36,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:52:36,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:52:36,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:52:36,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:52:36,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:52:36,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:52:36,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:52:36,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:52:36,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:52:36,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:52:36,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:52:36,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:52:36,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:52:36,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:52:36,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:52:36,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:52:36,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:52:36,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:52:36,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:52:36,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:52:36,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:52:36,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:52:36,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:52:36,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:52:36,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:52:36,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:52:36,077 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:52:36,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:52:36,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:52:36,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:52:36,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:52:36,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:52:36,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:52:36,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:52:36,080 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:52:36,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:52:36,082 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:52:36,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:52:36,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:52:36,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:52:36,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:52:36,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:52:36,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:52:36,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:52:36,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:52:36,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:52:36,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:52:36,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:52:36,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:52:36,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:52:36,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:52:36,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:52:36,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:52:36,087 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:52:36,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:52:36,088 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:52:36,094 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 869ef2ac3e655b6efbdfa5c05d637a0f622008da83d6042d15962fe695aee939 [2023-02-14 22:52:36,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:52:36,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:52:36,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:52:36,367 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:52:36,367 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:52:36,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2023-02-14 22:52:37,559 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:52:37,785 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:52:37,785 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2023-02-14 22:52:37,802 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/838dcc400/b0135201b1bb48cf94b4ddd7896b54b0/FLAG002666e00 [2023-02-14 22:52:37,814 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/838dcc400/b0135201b1bb48cf94b4ddd7896b54b0 [2023-02-14 22:52:37,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:52:37,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:52:37,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:52:37,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:52:37,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:52:37,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:52:37" (1/1) ... [2023-02-14 22:52:37,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202130ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:37, skipping insertion in model container [2023-02-14 22:52:37,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:52:37" (1/1) ... [2023-02-14 22:52:37,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:52:37,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:52:38,172 WARN L237 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_lock.i[25842,25855] [2023-02-14 22:52:38,180 WARN L237 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_lock.i[25967,25980] [2023-02-14 22:52:38,183 WARN L237 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_lock.i[26082,26095] [2023-02-14 22:52:38,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:52:38,197 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:52:38,261 WARN L237 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_lock.i[25842,25855] [2023-02-14 22:52:38,266 WARN L237 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_lock.i[25967,25980] [2023-02-14 22:52:38,267 WARN L237 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_lock.i[26082,26095] [2023-02-14 22:52:38,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:52:38,300 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:52:38,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38 WrapperNode [2023-02-14 22:52:38,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:52:38,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:52:38,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:52:38,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:52:38,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,376 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2023-02-14 22:52:38,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:52:38,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:52:38,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:52:38,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:52:38,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:52:38,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:52:38,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:52:38,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:52:38,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (1/1) ... [2023-02-14 22:52:38,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:52:38,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:52:38,486 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) [2023-02-14 22:52:38,501 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 [2023-02-14 22:52:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-14 22:52:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-14 22:52:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-14 22:52:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-14 22:52:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 22:52:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-14 22:52:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-14 22:52:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:52:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 22:52:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-14 22:52:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-14 22:52:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 22:52:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 22:52:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 22:52:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:52:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-14 22:52:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-14 22:52:38,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:52:38,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:52:38,652 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:52:38,654 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:52:38,929 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:52:38,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:52:38,936 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 22:52:38,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:52:38 BoogieIcfgContainer [2023-02-14 22:52:38,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:52:38,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:52:38,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:52:38,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:52:38,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:52:37" (1/3) ... [2023-02-14 22:52:38,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6563da4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:52:38, skipping insertion in model container [2023-02-14 22:52:38,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:52:38" (2/3) ... [2023-02-14 22:52:38,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6563da4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:52:38, skipping insertion in model container [2023-02-14 22:52:38,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:52:38" (3/3) ... [2023-02-14 22:52:38,951 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2023-02-14 22:52:38,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:52:38,968 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-14 22:52:39,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:52:39,024 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ef8a0ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:52:39,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-14 22:52:39,028 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) [2023-02-14 22:52:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 22:52:39,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:52:39,035 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] [2023-02-14 22:52:39,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:52:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:52:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-02-14 22:52:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:52:39,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085948579] [2023-02-14 22:52:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:52:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 22:52:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-14 22:52:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:52:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:52:39,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085948579] [2023-02-14 22:52:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085948579] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:52:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:52:39,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 22:52:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474576722] [2023-02-14 22:52:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:52:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 22:52:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:52:39,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 22:52:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 22:52:39,401 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) [2023-02-14 22:52:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:52:39,581 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-02-14 22:52:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 22:52:39,584 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 [2023-02-14 22:52:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:52:39,596 INFO L225 Difference]: With dead ends: 147 [2023-02-14 22:52:39,596 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 22:52:39,601 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 [2023-02-14 22:52:39,606 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:52:39,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:52:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 22:52:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-02-14 22:52:39,660 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) [2023-02-14 22:52:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-14 22:52:39,664 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-02-14 22:52:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:52:39,665 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-14 22:52:39,665 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) [2023-02-14 22:52:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-14 22:52:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 22:52:39,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:52:39,669 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] [2023-02-14 22:52:39,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:52:39,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:52:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:52:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-02-14 22:52:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:52:39,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161493564] [2023-02-14 22:52:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:52:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 22:52:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-14 22:52:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:52:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:52:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161493564] [2023-02-14 22:52:39,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161493564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:52:39,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:52:39,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 22:52:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55894003] [2023-02-14 22:52:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:52:39,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 22:52:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:52:39,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 22:52:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 22:52:39,891 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) [2023-02-14 22:52:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:52:40,102 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-02-14 22:52:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 22:52:40,103 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 [2023-02-14 22:52:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:52:40,108 INFO L225 Difference]: With dead ends: 82 [2023-02-14 22:52:40,108 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 22:52:40,109 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 [2023-02-14 22:52:40,110 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:52:40,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:52:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 22:52:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-02-14 22:52:40,121 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) [2023-02-14 22:52:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-02-14 22:52:40,127 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-02-14 22:52:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:52:40,128 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-02-14 22:52:40,128 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) [2023-02-14 22:52:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-02-14 22:52:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 22:52:40,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:52:40,130 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] [2023-02-14 22:52:40,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:52:40,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:52:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:52:40,131 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-02-14 22:52:40,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:52:40,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19825735] [2023-02-14 22:52:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:52:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 22:52:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-14 22:52:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 22:52:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:52:40,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19825735] [2023-02-14 22:52:40,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19825735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:52:40,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:52:40,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 22:52:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937438950] [2023-02-14 22:52:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:52:40,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 22:52:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:52:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 22:52:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:52:40,442 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) [2023-02-14 22:52:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:52:40,900 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-02-14 22:52:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 22:52:40,901 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 [2023-02-14 22:52:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:52:40,903 INFO L225 Difference]: With dead ends: 206 [2023-02-14 22:52:40,903 INFO L226 Difference]: Without dead ends: 145 [2023-02-14 22:52:40,904 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 [2023-02-14 22:52:40,905 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:52:40,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 168 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 22:52:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-14 22:52:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-02-14 22:52:40,920 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) [2023-02-14 22:52:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-14 22:52:40,921 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-02-14 22:52:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:52:40,922 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-14 22:52:40,922 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) [2023-02-14 22:52:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-14 22:52:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-14 22:52:40,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:52:40,924 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] [2023-02-14 22:52:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 22:52:40,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:52:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:52:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-02-14 22:52:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:52:40,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616670568] [2023-02-14 22:52:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:52:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 22:52:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-14 22:52:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-14 22:52:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-14 22:52:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-14 22:52:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-14 22:52:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-14 22:52:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-14 22:52:41,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:52:41,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616670568] [2023-02-14 22:52:41,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616670568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:52:41,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803766135] [2023-02-14 22:52:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:41,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:52:41,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:52:41,077 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) [2023-02-14 22:52:41,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 22:52:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:52:41,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 22:52:41,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:52:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-14 22:52:41,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 22:52:41,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803766135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:52:41,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 22:52:41,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-14 22:52:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269929596] [2023-02-14 22:52:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:52:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:52:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:52:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:52:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:52:41,342 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) [2023-02-14 22:52:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:52:41,383 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-02-14 22:52:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:52:41,388 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 [2023-02-14 22:52:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:52:41,390 INFO L225 Difference]: With dead ends: 219 [2023-02-14 22:52:41,390 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 22:52:41,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:52:41,392 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 [2023-02-14 22:52:41,396 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] [2023-02-14 22:52:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 22:52:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-14 22:52:41,415 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) [2023-02-14 22:52:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-14 22:52:41,416 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-02-14 22:52:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:52:41,417 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-14 22:52:41,417 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) [2023-02-14 22:52:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-14 22:52:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-14 22:52:41,419 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:52:41,419 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] [2023-02-14 22:52:41,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 22:52:41,625 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 [2023-02-14 22:52:41,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:52:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:52:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-02-14 22:52:41,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:52:41,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809699714] [2023-02-14 22:52:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:52:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:52:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:52:41,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 22:52:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:52:41,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 22:52:41,717 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 22:52:41,718 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-02-14 22:52:41,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-02-14 22:52:41,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-02-14 22:52:41,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 22:52:41,723 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-02-14 22:52:41,727 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 22:52:41,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:52:41 BoogieIcfgContainer [2023-02-14 22:52:41,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 22:52:41,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 22:52:41,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 22:52:41,766 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 22:52:41,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:52:38" (3/4) ... [2023-02-14 22:52:41,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 22:52:41,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 22:52:41,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 22:52:41,814 INFO L158 Benchmark]: Toolchain (without parser) took 3994.39ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 86.7MB in the beginning and 105.2MB in the end (delta: -18.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,814 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:52:41,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.72ms. Allocated memory is still 130.0MB. Free memory was 86.7MB in the beginning and 67.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.90ms. Allocated memory is still 130.0MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,815 INFO L158 Benchmark]: Boogie Preprocessor took 70.73ms. Allocated memory is still 130.0MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,816 INFO L158 Benchmark]: RCFGBuilder took 491.38ms. Allocated memory is still 130.0MB. Free memory was 62.7MB in the beginning and 91.8MB in the end (delta: -29.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,816 INFO L158 Benchmark]: TraceAbstraction took 2822.47ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 91.1MB in the beginning and 109.3MB in the end (delta: -18.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,816 INFO L158 Benchmark]: Witness Printer took 47.65ms. Allocated memory is still 161.5MB. Free memory was 109.3MB in the beginning and 105.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-14 22:52:41,818 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.18ms. Allocated memory is still 130.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.72ms. Allocated memory is still 130.0MB. Free memory was 86.7MB in the beginning and 67.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.90ms. Allocated memory is still 130.0MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.73ms. Allocated memory is still 130.0MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.38ms. Allocated memory is still 130.0MB. Free memory was 62.7MB in the beginning and 91.8MB in the end (delta: -29.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2822.47ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 91.1MB in the beginning and 109.3MB in the end (delta: -18.3MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 47.65ms. Allocated memory is still 161.5MB. Free memory was 109.3MB in the beginning and 105.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 669]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [mutexes={3:0}] [L692] CALL foo() [L681] FCALL ldv_initialize() [L682] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-1:0}, mutexes={3:0}, ptr={-1:0}, size=8] [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={-1:0}, mutexes={3:0}] [L682] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L683] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-2:0}, mutexes={3:0}, ptr={-2:0}, size=8] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={-2:0}, m1={-1:0}, mutexes={3:0}] [L683] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L684] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=0, m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L670] CALL ldv_set_add(m, &mutexes) [L636] CALL, EXPR ldv_is_in_set(new, s) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L660] return 0; VAL [\result=0, __mptr={3:0}, e={-1:0}, e={-1:0}, m={3:-4}, mutexes={3:0}, s={3:0}, s={3:0}] [L636] RET, EXPR ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; VAL [mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L638] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [mutexes={3:0}] [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=12, \result={-3:0}, mutexes={3:0}, ptr={-3:0}, size=12] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={-3:0}, mutexes={3:0}, new={-1:0}, new={-1:0}, s={3:0}, s={3:0}] [L638] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] le->e = new [L640] CALL ldv_list_add(&le->list, s) [L608] EXPR head->next VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={-3:4}, new={-3:4}] [L608] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={3:0}, new={-3:4}, next={3:0}, prev={3:0}] [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new VAL [mutexes={3:0}, new={-3:4}, new={-3:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L608] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, head->next={3:0}, mutexes={3:0}, new={-3:4}, new={-3:4}] [L640] RET ldv_list_add(&le->list, s) [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) VAL [m1={-1:0}, m2={-2:0}, mutexes={3:0}] [L685] CALL mutex_lock(m1) VAL [mutexes={3:0}] [L669] CALL ldv_is_in_set(m, &mutexes) VAL [e={-1:0}, mutexes={3:0}, s={3:0}] [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L655] COND TRUE &m->list != (s) [L656] EXPR m->e VAL [__mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, m->e={-1:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\result=1, __mptr={-3:4}, e={-1:0}, e={-1:0}, m={-3:0}, mutexes={3:0}, s={3:0}, s={3:0}] [L669] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={-1:0}, m={-1:0}, mutexes={3:0}] [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [m={-1:0}, m={-1:0}, mutexes={3:0}] - UnprovableResult [Line: 673]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 70 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 595 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 218 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 136/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-14 22:52:41,851 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE