./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_unlock_at_exit.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 fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:29:26,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:29:26,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:29:26,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:29:26,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:29:26,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:29:26,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:29:26,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:29:26,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:29:26,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:29:26,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:29:26,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:29:26,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:29:26,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:29:26,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:29:26,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:29:26,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:29:26,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:29:26,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:29:26,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:29:26,146 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:29:26,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:29:26,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:29:26,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:29:26,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:29:26,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:29:26,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:29:26,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:29:26,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:29:26,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:29:26,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:29:26,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:29:26,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:29:26,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:29:26,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:29:26,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:29:26,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:29:26,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:29:26,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:29:26,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:29:26,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:29:26,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:29:26,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:29:26,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:29:26,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:29:26,208 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:29:26,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:29:26,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:29:26,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:29:26,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:29:26,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:29:26,210 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:29:26,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:29:26,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:29:26,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:29:26,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:29:26,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:29:26,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:29:26,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:29:26,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:29:26,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:29:26,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:29:26,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:29:26,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:29:26,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:29:26,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:29:26,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:29:26,214 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:29:26,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:29:26,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:29:26,214 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 -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2022-07-12 03:29:26,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:29:26,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:29:26,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:29:26,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:29:26,452 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:29:26,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2022-07-12 03:29:26,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12daa457/1a55b578afc64aa5bd6c8fdcebc6cafa/FLAG040d1a388 [2022-07-12 03:29:26,911 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:29:26,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2022-07-12 03:29:26,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12daa457/1a55b578afc64aa5bd6c8fdcebc6cafa/FLAG040d1a388 [2022-07-12 03:29:27,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12daa457/1a55b578afc64aa5bd6c8fdcebc6cafa [2022-07-12 03:29:27,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:29:27,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:29:27,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:29:27,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:29:27,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:29:27,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a30ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27, skipping insertion in model container [2022-07-12 03:29:27,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:29:27,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:29:27,655 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_unlock_at_exit.i[25842,25855] [2022-07-12 03:29:27,657 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_unlock_at_exit.i[25967,25980] [2022-07-12 03:29:27,658 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_unlock_at_exit.i[26082,26095] [2022-07-12 03:29:27,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:29:27,664 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:29:27,771 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_unlock_at_exit.i[25842,25855] [2022-07-12 03:29:27,771 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_unlock_at_exit.i[25967,25980] [2022-07-12 03:29:27,772 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_unlock_at_exit.i[26082,26095] [2022-07-12 03:29:27,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:29:27,801 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:29:27,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27 WrapperNode [2022-07-12 03:29:27,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:29:27,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:29:27,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:29:27,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:29:27,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,832 INFO L137 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 128 [2022-07-12 03:29:27,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:29:27,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:29:27,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:29:27,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:29:27,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:29:27,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:29:27,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:29:27,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:29:27,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (1/1) ... [2022-07-12 03:29:27,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:29:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:29:27,887 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-12 03:29:27,908 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-12 03:29:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:29:27,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:29:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:29:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:29:27,958 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:29:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:29:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:29:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:29:27,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:29:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:29:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:29:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:29:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:29:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:29:27,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:29:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:29:27,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:29:28,092 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:29:28,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:29:28,383 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:29:28,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:29:28,388 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:29:28,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:29:28 BoogieIcfgContainer [2022-07-12 03:29:28,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:29:28,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:29:28,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:29:28,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:29:28,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:29:27" (1/3) ... [2022-07-12 03:29:28,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcab9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:29:28, skipping insertion in model container [2022-07-12 03:29:28,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:27" (2/3) ... [2022-07-12 03:29:28,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcab9ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:29:28, skipping insertion in model container [2022-07-12 03:29:28,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:29:28" (3/3) ... [2022-07-12 03:29:28,423 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2022-07-12 03:29:28,433 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:29:28,438 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:29:28,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:29:28,480 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@45994955, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f804b2a [2022-07-12 03:29:28,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:29:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:29:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:29:28,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:28,489 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-12 03:29:28,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:28,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1577806477, now seen corresponding path program 1 times [2022-07-12 03:29:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:29:28,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877205517] [2022-07-12 03:29:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:29:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:29:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:29:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:29:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,729 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-12 03:29:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:29:28,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877205517] [2022-07-12 03:29:28,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877205517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:28,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:28,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:29:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774815762] [2022-07-12 03:29:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:28,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:29:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:29:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:29:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:29:28,760 INFO L87 Difference]: Start difference. First operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-12 03:29:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:28,828 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2022-07-12 03:29:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:29:28,830 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-12 03:29:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:28,836 INFO L225 Difference]: With dead ends: 131 [2022-07-12 03:29:28,837 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 03:29:28,840 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-12 03:29:28,843 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:29:28,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 109 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:29:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 03:29:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-07-12 03:29:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:29:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-07-12 03:29:28,884 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 28 [2022-07-12 03:29:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:28,884 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-07-12 03:29:28,885 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-12 03:29:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-07-12 03:29:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:29:28,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:28,887 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-12 03:29:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:29:28,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -109345869, now seen corresponding path program 1 times [2022-07-12 03:29:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:29:28,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612823620] [2022-07-12 03:29:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:28,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:29:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:29:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:29:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:29:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,037 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-12 03:29:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:29:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612823620] [2022-07-12 03:29:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612823620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:29,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:29,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:29:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814277055] [2022-07-12 03:29:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:29,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:29:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:29:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:29:29,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:29:29,041 INFO L87 Difference]: Start difference. First operand 61 states and 70 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-12 03:29:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:29,148 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-07-12 03:29:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:29:29,149 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-12 03:29:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:29,151 INFO L225 Difference]: With dead ends: 70 [2022-07-12 03:29:29,151 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 03:29:29,152 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-12 03:29:29,154 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:29:29,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 202 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:29:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 03:29:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-12 03:29:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 03:29:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-12 03:29:29,170 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 28 [2022-07-12 03:29:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:29,170 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-12 03:29:29,170 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-12 03:29:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-12 03:29:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:29:29,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:29,172 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-12 03:29:29,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:29:29,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1465257436, now seen corresponding path program 1 times [2022-07-12 03:29:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:29:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384975170] [2022-07-12 03:29:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:29:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:29:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:29:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:29:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:29,320 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-12 03:29:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:29:29,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384975170] [2022-07-12 03:29:29,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384975170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:29,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:29:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376578017] [2022-07-12 03:29:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:29,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:29:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:29:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:29:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:29:29,327 INFO L87 Difference]: Start difference. First operand 65 states and 76 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-12 03:29:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:29,869 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2022-07-12 03:29:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:29:29,870 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-12 03:29:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:29,871 INFO L225 Difference]: With dead ends: 186 [2022-07-12 03:29:29,871 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 03:29:29,872 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-12 03:29:29,873 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:29:29,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 255 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 03:29:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 03:29:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2022-07-12 03:29:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 77 states have internal predecessors, (83), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-12 03:29:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2022-07-12 03:29:29,882 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 28 [2022-07-12 03:29:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:29,883 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2022-07-12 03:29:29,883 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-12 03:29:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2022-07-12 03:29:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 03:29:29,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:29,885 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-12 03:29:29,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:29:29,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:29,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1566335676, now seen corresponding path program 1 times [2022-07-12 03:29:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:29:29,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317162058] [2022-07-12 03:29:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:29,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:29:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:29:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:29:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:29:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 03:29:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:29:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 03:29:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 03:29:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 03:29:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,574 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-12 03:29:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:29:31,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317162058] [2022-07-12 03:29:31,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317162058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:29:31,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142922607] [2022-07-12 03:29:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:31,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:29:31,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:29:31,577 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-12 03:29:31,639 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-12 03:29:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:31,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 218 conjunts are in the unsatisfiable core [2022-07-12 03:29:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:32,067 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:29:32,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:29:32,385 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 03:29:32,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 03:29:32,557 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-12 03:29:32,569 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-12 03:29:36,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:29:36,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:29:36,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:29:36,136 INFO L356 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2022-07-12 03:29:36,137 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:29:36,173 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-12 03:29:36,337 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-12 03:29:36,338 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 83 context size 83 output size 83 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:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-12 03:29:36,341 INFO L158 Benchmark]: Toolchain (without parser) took 9060.07ms. Allocated memory was 115.3MB in the beginning and 207.6MB in the end (delta: 92.3MB). Free memory was 88.6MB in the beginning and 87.5MB in the end (delta: 1.1MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,341 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:29:36,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.11ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 79.8MB in the end (delta: 8.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.66ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 77.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,342 INFO L158 Benchmark]: Boogie Preprocessor took 20.84ms. Allocated memory is still 115.3MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,342 INFO L158 Benchmark]: RCFGBuilder took 535.16ms. Allocated memory is still 115.3MB. Free memory was 75.3MB in the beginning and 58.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,342 INFO L158 Benchmark]: TraceAbstraction took 7949.62ms. Allocated memory was 115.3MB in the beginning and 207.6MB in the end (delta: 92.3MB). Free memory was 57.9MB in the beginning and 87.5MB in the end (delta: -29.6MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2022-07-12 03:29:36,343 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.11ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 79.8MB in the end (delta: 8.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.66ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 77.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.84ms. Allocated memory is still 115.3MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 535.16ms. Allocated memory is still 115.3MB. Free memory was 75.3MB in the beginning and 58.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7949.62ms. Allocated memory was 115.3MB in the beginning and 207.6MB in the end (delta: 92.3MB). Free memory was 57.9MB in the beginning and 87.5MB in the end (delta: -29.6MB). Peak memory consumption was 63.9MB. 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 83 context size 83 output size 83 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_4| input size 83 context size 83 output size 83: 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-12 03:29:36,375 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_unlock_at_exit.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 fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:29:38,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:29:38,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:29:38,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:29:38,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:29:38,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:29:38,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:29:38,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:29:38,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:29:38,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:29:38,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:29:38,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:29:38,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:29:38,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:29:38,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:29:38,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:29:38,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:29:38,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:29:38,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:29:38,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:29:38,378 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:29:38,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:29:38,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:29:38,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:29:38,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:29:38,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:29:38,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:29:38,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:29:38,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:29:38,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:29:38,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:29:38,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:29:38,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:29:38,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:29:38,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:29:38,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:29:38,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:29:38,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:29:38,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:29:38,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:29:38,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:29:38,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:29:38,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:29:38,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:29:38,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:29:38,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:29:38,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:29:38,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:29:38,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:29:38,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:29:38,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:29:38,422 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:29:38,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:29:38,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:29:38,423 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:29:38,424 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:29:38,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:29:38,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:29:38,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:29:38,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:29:38,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:29:38,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:29:38,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:29:38,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:29:38,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:29:38,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:29:38,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:29:38,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:29:38,427 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 -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2022-07-12 03:29:38,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:29:38,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:29:38,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:29:38,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:29:38,739 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:29:38,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2022-07-12 03:29:38,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160bcf343/4d913532270c48b0bfc92fbe47a57e67/FLAGdba574e34 [2022-07-12 03:29:39,231 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:29:39,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2022-07-12 03:29:39,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160bcf343/4d913532270c48b0bfc92fbe47a57e67/FLAGdba574e34 [2022-07-12 03:29:39,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160bcf343/4d913532270c48b0bfc92fbe47a57e67 [2022-07-12 03:29:39,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:29:39,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:29:39,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:29:39,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:29:39,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:29:39,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37483400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39, skipping insertion in model container [2022-07-12 03:29:39,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:29:39,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:29:39,623 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_unlock_at_exit.i[25842,25855] [2022-07-12 03:29:39,627 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_unlock_at_exit.i[25967,25980] [2022-07-12 03:29:39,629 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_unlock_at_exit.i[26082,26095] [2022-07-12 03:29:39,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:29:39,639 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 03:29:39,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:29:39,681 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_unlock_at_exit.i[25842,25855] [2022-07-12 03:29:39,684 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_unlock_at_exit.i[25967,25980] [2022-07-12 03:29:39,685 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_unlock_at_exit.i[26082,26095] [2022-07-12 03:29:39,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:29:39,690 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:29:39,731 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_unlock_at_exit.i[25842,25855] [2022-07-12 03:29:39,734 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_unlock_at_exit.i[25967,25980] [2022-07-12 03:29:39,734 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_unlock_at_exit.i[26082,26095] [2022-07-12 03:29:39,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:29:39,784 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:29:39,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39 WrapperNode [2022-07-12 03:29:39,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:29:39,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:29:39,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:29:39,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:29:39,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,840 INFO L137 Inliner]: procedures = 140, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 124 [2022-07-12 03:29:39,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:29:39,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:29:39,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:29:39,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:29:39,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:29:39,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:29:39,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:29:39,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:29:39,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (1/1) ... [2022-07-12 03:29:39,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:29:39,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:29:39,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-12 03:29:39,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-12 03:29:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-12 03:29:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-12 03:29:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:29:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 03:29:39,968 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 03:29:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:29:39,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2022-07-12 03:29:39,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:29:39,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 03:29:39,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 03:29:39,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:29:39,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:29:40,113 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:29:40,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:29:40,436 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:29:40,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:29:40,440 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:29:40,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:29:40 BoogieIcfgContainer [2022-07-12 03:29:40,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:29:40,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:29:40,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:29:40,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:29:40,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:29:39" (1/3) ... [2022-07-12 03:29:40,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd71072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:29:40, skipping insertion in model container [2022-07-12 03:29:40,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:29:39" (2/3) ... [2022-07-12 03:29:40,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd71072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:29:40, skipping insertion in model container [2022-07-12 03:29:40,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:29:40" (3/3) ... [2022-07-12 03:29:40,475 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2022-07-12 03:29:40,485 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:29:40,494 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 03:29:40,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:29:40,553 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@2e510bd5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b53da8d [2022-07-12 03:29:40,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 03:29:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:29:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:29:40,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:40,563 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-12 03:29:40,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -819579598, now seen corresponding path program 1 times [2022-07-12 03:29:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:40,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684372844] [2022-07-12 03:29:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:40,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:40,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:40,583 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-12 03:29:40,610 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-12 03:29:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:40,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:29:40,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:29:40,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:29:40,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:40,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684372844] [2022-07-12 03:29:40,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684372844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:40,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:40,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:29:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300047289] [2022-07-12 03:29:40,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:29:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:29:40,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:29:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:29:40,726 INFO L87 Difference]: Start difference. First operand has 63 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:29:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:40,743 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2022-07-12 03:29:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:29:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-12 03:29:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:40,749 INFO L225 Difference]: With dead ends: 122 [2022-07-12 03:29:40,749 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 03:29:40,751 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-12 03:29:40,753 INFO L413 NwaCegarLoop]: 72 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, 72 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-12 03:29:40,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:29:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 03:29:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-12 03:29:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:29:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-07-12 03:29:40,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 27 [2022-07-12 03:29:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:40,780 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-07-12 03:29:40,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:29:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-07-12 03:29:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:29:40,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:40,794 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-12 03:29:40,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:29:40,999 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-12 03:29:40,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1880588558, now seen corresponding path program 1 times [2022-07-12 03:29:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:41,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335946475] [2022-07-12 03:29:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:41,002 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-12 03:29:41,011 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-12 03:29:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:41,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:29:41,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:41,155 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-12 03:29:41,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:29:41,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335946475] [2022-07-12 03:29:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335946475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:41,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:41,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:29:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006322719] [2022-07-12 03:29:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:41,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:29:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:29:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:29:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:29:41,167 INFO L87 Difference]: Start difference. First operand 58 states and 67 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-12 03:29:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:41,200 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-12 03:29:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:29:41,202 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-12 03:29:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:41,206 INFO L225 Difference]: With dead ends: 63 [2022-07-12 03:29:41,206 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 03:29:41,207 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-12 03:29:41,207 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 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-12 03:29:41,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:29:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 03:29:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 03:29:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 03:29:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-07-12 03:29:41,224 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2022-07-12 03:29:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:41,225 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-07-12 03:29:41,225 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-12 03:29:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-07-12 03:29:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:29:41,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:41,239 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-12 03:29:41,258 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-12 03:29:41,440 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-12 03:29:41,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1829794903, now seen corresponding path program 1 times [2022-07-12 03:29:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807646440] [2022-07-12 03:29:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:41,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:41,443 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-12 03:29:41,445 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-12 03:29:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:41,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:29:41,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:41,808 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-12 03:29:41,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:29:41,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:41,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807646440] [2022-07-12 03:29:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807646440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:41,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:41,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:29:41,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269326904] [2022-07-12 03:29:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:41,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:29:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:29:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:29:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:29:41,813 INFO L87 Difference]: Start difference. First operand 61 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-12 03:29:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:42,090 INFO L93 Difference]: Finished difference Result 164 states and 201 transitions. [2022-07-12 03:29:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:29:42,091 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-12 03:29:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:42,092 INFO L225 Difference]: With dead ends: 164 [2022-07-12 03:29:42,092 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 03:29:42,092 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-12 03:29:42,093 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:29:42,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 162 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:29:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 03:29:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-12 03:29:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.171875) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-12 03:29:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-12 03:29:42,109 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 27 [2022-07-12 03:29:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:42,110 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-12 03:29:42,110 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-12 03:29:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-12 03:29:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 03:29:42,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:42,114 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] [2022-07-12 03:29:42,124 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-12 03:29:42,315 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-12 03:29:42,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1772695523, now seen corresponding path program 1 times [2022-07-12 03:29:42,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:42,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630161820] [2022-07-12 03:29:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:42,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:42,322 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-12 03:29:42,322 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-12 03:29:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:42,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:29:42,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:42,482 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-12 03:29:42,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:29:42,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630161820] [2022-07-12 03:29:42,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630161820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:42,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:42,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:29:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043534859] [2022-07-12 03:29:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:29:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:29:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:29:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:29:42,499 INFO L87 Difference]: Start difference. First operand 90 states and 109 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:29:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:42,536 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2022-07-12 03:29:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:29:42,536 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-12 03:29:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:42,537 INFO L225 Difference]: With dead ends: 160 [2022-07-12 03:29:42,537 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 03:29:42,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 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-12 03:29:42,538 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 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-12 03:29:42,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:29:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 03:29:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 03:29:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-12 03:29:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-12 03:29:42,546 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 66 [2022-07-12 03:29:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:42,547 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-12 03:29:42,547 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 03:29:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-12 03:29:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 03:29:42,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:42,548 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] [2022-07-12 03:29:42,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:29:42,772 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-12 03:29:42,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash -644548811, now seen corresponding path program 1 times [2022-07-12 03:29:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:42,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200111029] [2022-07-12 03:29:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:42,776 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-12 03:29:42,777 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-12 03:29:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:42,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 03:29:42,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:43,096 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-12 03:29:43,100 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-12 03:29:43,321 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-12 03:29:43,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:29:43,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:29:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200111029] [2022-07-12 03:29:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200111029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:29:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:29:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:29:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947970586] [2022-07-12 03:29:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:29:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:29:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:29:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:29:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:29:43,323 INFO L87 Difference]: Start difference. First operand 94 states and 113 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, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 03:29:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:29:44,168 INFO L93 Difference]: Finished difference Result 214 states and 259 transitions. [2022-07-12 03:29:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:29:44,168 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, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 66 [2022-07-12 03:29:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:29:44,170 INFO L225 Difference]: With dead ends: 214 [2022-07-12 03:29:44,170 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 03:29:44,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:29:44,171 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 153 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:29:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 190 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 03:29:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 03:29:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2022-07-12 03:29:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 76 states have internal predecessors, (82), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (21), 14 states have call predecessors, (21), 13 states have call successors, (21) [2022-07-12 03:29:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2022-07-12 03:29:44,192 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 66 [2022-07-12 03:29:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:29:44,193 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2022-07-12 03:29:44,193 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, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-12 03:29:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-07-12 03:29:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 03:29:44,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:29:44,194 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-12 03:29:44,207 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-12 03:29:44,408 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-12 03:29:44,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:29:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:29:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1371790266, now seen corresponding path program 1 times [2022-07-12 03:29:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:29:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114942543] [2022-07-12 03:29:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:29:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:29:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:29:44,410 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-12 03:29:44,422 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-12 03:29:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:29:44,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-12 03:29:44,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:29:44,665 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 6 treesize of output 5 [2022-07-12 03:29:44,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:29:44,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:29:44,895 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-12 03:29:45,700 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-12 03:29:45,701 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 194 treesize of output 281 [2022-07-12 03:29:45,724 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-12 03:29:45,738 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-12 03:29:45,755 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-12 03:29:46,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:46,360 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-12 03:29:46,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 236 treesize of output 205 [2022-07-12 03:29:46,488 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-12 03:29:46,493 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-12 03:29:46,530 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-12 03:29:46,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:29:46,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:46,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:29:46,548 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 56 treesize of output 17 [2022-07-12 03:29:46,550 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-12 03:29:46,553 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-12 03:29:46,650 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|))) (.cse0 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse4 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse2 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (or (and (not .cse0) (or (and .cse1 .cse2) (and .cse1 (or (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (and (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse3 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse3 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_7)))) .cse4 (exists ((v_prenex_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_16) |c___ldv_list_add_#in~new.base| v_prenex_17) |c___ldv_list_add_#in~prev.base| v_prenex_18) |c___ldv_list_add_#in~next.base| v_prenex_16) |c___ldv_list_add_#in~new.base| v_prenex_17) |c___ldv_list_add_#in~prev.base| v_prenex_18))) (and (= (select .cse5 |c___ldv_list_add_#in~next.base|) v_prenex_16) (= |c___ldv_list_add_#in~new.offset| (select v_prenex_18 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse5 |c___ldv_list_add_#in~new.base|) (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|)))))) (and (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (let ((.cse7 (select .cse6 |c___ldv_list_add_#in~next.base|))) (and (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse6 |c___ldv_list_add_#in~new.base|)) (= .cse7 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|)) (= .cse7 v_DerPreprocessor_7))))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_5) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_6) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_5) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_6))) (let ((.cse8 (select .cse9 |c___ldv_list_add_#in~next.base|))) (and (= .cse8 v_DerPreprocessor_4) (= .cse8 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_6 |c___ldv_list_add_#in~prev.offset|)) (= (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|) (select .cse9 |c___ldv_list_add_#in~new.base|))))))))))) (and .cse1 .cse0 (or (and (exists ((v_prenex_42 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_40) |c___ldv_list_add_#in~new.base| v_prenex_41) |c___ldv_list_add_#in~prev.base| v_prenex_42) |c___ldv_list_add_#in~next.base| v_prenex_40) |c___ldv_list_add_#in~new.base| v_prenex_41) |c___ldv_list_add_#in~prev.base| v_prenex_42))) (and (= (select .cse10 |c___ldv_list_add_#in~new.base|) v_prenex_41) (= (select .cse10 |c___ldv_list_add_#in~next.base|) v_prenex_40) (= |c___ldv_list_add_#in~new.offset| (select v_prenex_42 |c___ldv_list_add_#in~prev.offset|))))) .cse4) (and (exists ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_37) |c___ldv_list_add_#in~new.base| v_prenex_38) |c___ldv_list_add_#in~prev.base| v_prenex_39) |c___ldv_list_add_#in~next.base| v_prenex_37) |c___ldv_list_add_#in~new.base| v_prenex_38) |c___ldv_list_add_#in~prev.base| v_prenex_39))) (and (= |c___ldv_list_add_#in~new.offset| (select v_prenex_39 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse11 |c___ldv_list_add_#in~new.base|) v_prenex_38) (= (select .cse11 |c___ldv_list_add_#in~next.base|) (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|))))) (not .cse2)) (and .cse2 (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 ((.cse12 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_1) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_2) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_3))) (and (= (select .cse12 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_1) (= (select .cse12 |c___ldv_list_add_#in~new.base|) v_DerPreprocessor_2) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|)))))) (exists ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_prenex_37) |c___ldv_list_add_#in~new.base| v_prenex_38) |c___ldv_list_add_#in~prev.base| v_prenex_39) |c___ldv_list_add_#in~next.base| v_prenex_37) |c___ldv_list_add_#in~new.base| v_prenex_38) |c___ldv_list_add_#in~prev.base| v_prenex_39))) (let ((.cse13 (select .cse14 |c___ldv_list_add_#in~next.base|))) (and (= |c___ldv_list_add_#in~new.offset| (select .cse13 |c___ldv_list_add_#in~prev.offset|)) (= |c___ldv_list_add_#in~new.offset| (select v_prenex_39 |c___ldv_list_add_#in~prev.offset|)) (= v_prenex_37 .cse13) (= (select .cse14 |c___ldv_list_add_#in~new.base|) v_prenex_38) (= .cse13 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)))))))))) (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= (let ((.cse15 (let ((.cse16 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse16 |c___ldv_list_add_#in~new.base| (store (store (select .cse16 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse15 |c___ldv_list_add_#in~prev.base| (store (select .cse15 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from true [2022-07-12 03:31:14,910 WARN L233 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 167 DAG size of output: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:32:04,908 WARN L233 SmtUtils]: Spent 41.98s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:32:07,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:34:13,320 WARN L233 SmtUtils]: Spent 2.09m on a formula simplification. DAG size of input: 151 DAG size of output: 43 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-12 03:34:13,321 INFO L356 Elim1Store]: treesize reduction 432, result has 15.5 percent of original size [2022-07-12 03:34:13,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 7 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 11 new quantified variables, introduced 27 case distinctions, treesize of input 2037 treesize of output 1857