./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:42:47,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:42:47,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:42:47,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:42:47,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:42:47,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:42:47,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:42:47,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:42:47,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:42:47,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:42:47,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:42:47,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:42:47,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:42:47,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:42:47,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:42:47,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:42:47,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:42:47,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:42:47,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:42:47,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:42:47,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:42:47,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:42:47,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:42:47,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:42:47,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:42:47,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:42:47,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:42:47,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:42:47,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:42:47,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:42:47,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:42:47,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:42:47,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:42:47,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:42:47,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:42:47,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:42:47,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:42:47,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:42:47,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:42:47,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:42:47,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:42:47,353 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:42:47,367 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:42:47,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:42:47,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:42:47,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:42:47,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:42:47,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:42:47,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:42:47,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:42:47,369 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:42:47,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:42:47,370 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:42:47,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:42:47,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:42:47,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:42:47,372 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:42:47,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:42:47,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:42:47,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:42:47,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:42:47,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:42:47,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:42:47,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:42:47,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:42:47,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:42:47,374 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:42:47,375 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-02-15 19:42:47,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:42:47,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:42:47,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:42:47,566 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:42:47,567 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:42:47,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 19:42:48,483 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:42:48,758 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:42:48,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 19:42:48,779 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91351ee4/adfb8b4acbd748ae8560006a3c1267f0/FLAG0bb3034c9 [2023-02-15 19:42:49,082 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91351ee4/adfb8b4acbd748ae8560006a3c1267f0 [2023-02-15 19:42:49,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:42:49,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:42:49,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:42:49,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:42:49,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:42:49,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c25daa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49, skipping insertion in model container [2023-02-15 19:42:49,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:42:49,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:42:49,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-02-15 19:42:49,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-02-15 19:42:49,335 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-02-15 19:42:49,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:42:49,346 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:42:49,397 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-02-15 19:42:49,400 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-02-15 19:42:49,401 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-02-15 19:42:49,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:42:49,427 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:42:49,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49 WrapperNode [2023-02-15 19:42:49,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:42:49,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:42:49,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:42:49,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:42:49,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,480 INFO L138 Inliner]: procedures = 139, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 129 [2023-02-15 19:42:49,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:42:49,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:42:49,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:42:49,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:42:49,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:42:49,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:42:49,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:42:49,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:42:49,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (1/1) ... [2023-02-15 19:42:49,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:42:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:49,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:42:49,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:42:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 19:42:49,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 19:42:49,583 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 19:42:49,583 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:42:49,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 19:42:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 19:42:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:42:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:42:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:42:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:42:49,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 19:42:49,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 19:42:49,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:42:49,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:42:49,670 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:42:49,671 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:42:49,867 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:42:49,872 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:42:49,872 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 19:42:49,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:42:49 BoogieIcfgContainer [2023-02-15 19:42:49,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:42:49,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:42:49,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:42:49,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:42:49,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:42:49" (1/3) ... [2023-02-15 19:42:49,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7002287c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:42:49, skipping insertion in model container [2023-02-15 19:42:49,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:42:49" (2/3) ... [2023-02-15 19:42:49,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7002287c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:42:49, skipping insertion in model container [2023-02-15 19:42:49,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:42:49" (3/3) ... [2023-02-15 19:42:49,880 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-02-15 19:42:49,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:42:49,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 19:42:49,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:42:49,939 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5674db71, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:42:49,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 19:42:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:42:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:49,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:49,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:42:49,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:42:49,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 709034920, now seen corresponding path program 1 times [2023-02-15 19:42:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:49,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360315694] [2023-02-15 19:42:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:42:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:50,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360315694] [2023-02-15 19:42:50,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360315694] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:42:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004716058] [2023-02-15 19:42:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:50,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:42:50,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:42:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:42:50,165 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:42:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:50,304 INFO L93 Difference]: Finished difference Result 147 states and 193 transitions. [2023-02-15 19:42:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:42:50,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-02-15 19:42:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:50,320 INFO L225 Difference]: With dead ends: 147 [2023-02-15 19:42:50,320 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 19:42:50,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:42:50,325 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:50,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:42:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 19:42:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2023-02-15 19:42:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:42:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-15 19:42:50,354 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2023-02-15 19:42:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:50,354 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-15 19:42:50,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:42:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-15 19:42:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:50,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:50,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:42:50,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:42:50,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:42:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2117471768, now seen corresponding path program 1 times [2023-02-15 19:42:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:50,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514059659] [2023-02-15 19:42:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:42:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:50,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514059659] [2023-02-15 19:42:50,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514059659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:50,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:50,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:42:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979241112] [2023-02-15 19:42:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:42:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:42:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:42:50,550 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:42:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:50,748 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-02-15 19:42:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:42:50,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-15 19:42:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:50,751 INFO L225 Difference]: With dead ends: 82 [2023-02-15 19:42:50,752 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 19:42:50,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:42:50,754 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:50,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:42:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 19:42:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2023-02-15 19:42:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-02-15 19:42:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-02-15 19:42:50,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 28 [2023-02-15 19:42:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:50,766 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-02-15 19:42:50,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:42:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-02-15 19:42:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:42:50,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:50,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:42:50,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:42:50,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:42:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash -542868463, now seen corresponding path program 1 times [2023-02-15 19:42:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053092417] [2023-02-15 19:42:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 19:42:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:42:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:51,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053092417] [2023-02-15 19:42:51,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053092417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:51,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:42:51,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:42:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967216701] [2023-02-15 19:42:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:51,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:42:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:51,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:42:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:42:51,063 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:42:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:51,455 INFO L93 Difference]: Finished difference Result 206 states and 259 transitions. [2023-02-15 19:42:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:42:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-02-15 19:42:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:51,457 INFO L225 Difference]: With dead ends: 206 [2023-02-15 19:42:51,458 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 19:42:51,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:42:51,459 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:51,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 168 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:42:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 19:42:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-02-15 19:42:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 13 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2023-02-15 19:42:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2023-02-15 19:42:51,471 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 28 [2023-02-15 19:42:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:51,471 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2023-02-15 19:42:51,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:42:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2023-02-15 19:42:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 19:42:51,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:51,473 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:42:51,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:42:51,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:42:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash 391053642, now seen corresponding path program 1 times [2023-02-15 19:42:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:51,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063517324] [2023-02-15 19:42:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:42:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 19:42:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 19:42:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-15 19:42:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063517324] [2023-02-15 19:42:51,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063517324] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:42:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161991615] [2023-02-15 19:42:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:51,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:42:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:51,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:42:51,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:42:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:51,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:42:51,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:42:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 19:42:51,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:42:51,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161991615] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:42:51,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:42:51,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 19:42:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363240946] [2023-02-15 19:42:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:42:51,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:42:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:51,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:42:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:42:51,782 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 19:42:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:42:51,815 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2023-02-15 19:42:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:42:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2023-02-15 19:42:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:42:51,817 INFO L225 Difference]: With dead ends: 219 [2023-02-15 19:42:51,817 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 19:42:51,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:42:51,818 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:42:51,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:42:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 19:42:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-02-15 19:42:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 18 states have call successors, (18), 9 states have call predecessors, (18), 14 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2023-02-15 19:42:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-15 19:42:51,830 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 72 [2023-02-15 19:42:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:42:51,830 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-15 19:42:51,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 19:42:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-15 19:42:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 19:42:51,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:42:51,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:42:51,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:42:52,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:42:52,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:42:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:42:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash 336841398, now seen corresponding path program 1 times [2023-02-15 19:42:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:42:52,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249173537] [2023-02-15 19:42:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:42:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:42:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:42:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:42:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:42:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:42:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:42:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 19:42:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 19:42:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:42:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249173537] [2023-02-15 19:42:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249173537] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:42:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758117432] [2023-02-15 19:42:54,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:42:54,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:42:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:42:54,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:42:54,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:42:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:42:54,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 202 conjunts are in the unsatisfiable core [2023-02-15 19:42:54,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:42:54,969 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:42:54,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:42:55,144 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:42:55,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 19:42:55,282 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:42:55,285 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:42:56,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,517 INFO L321 Elim1Store]: treesize reduction 158, result has 24.0 percent of original size [2023-02-15 19:42:56,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 165 [2023-02-15 19:42:56,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2023-02-15 19:42:56,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,558 INFO L350 Elim1Store]: Elim1 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 112 treesize of output 80 [2023-02-15 19:42:56,572 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 19:42:56,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-02-15 19:42:56,591 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2023-02-15 19:42:56,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 96 [2023-02-15 19:42:56,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:42:56,601 INFO L350 Elim1Store]: Elim1 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 131 treesize of output 99 [2023-02-15 19:42:56,610 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 11 [2023-02-15 19:42:56,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:42:56,624 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:42:56,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 19:42:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 19:42:57,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:42:59,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758117432] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:42:59,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:42:59,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2023-02-15 19:42:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350938706] [2023-02-15 19:42:59,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:42:59,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-15 19:42:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:42:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-15 19:42:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4034, Unknown=7, NotChecked=0, Total=4290 [2023-02-15 19:42:59,144 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 19:43:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:05,947 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2023-02-15 19:43:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-15 19:43:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) Word has length 63 [2023-02-15 19:43:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:05,950 INFO L225 Difference]: With dead ends: 307 [2023-02-15 19:43:05,950 INFO L226 Difference]: Without dead ends: 235 [2023-02-15 19:43:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2932 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1055, Invalid=11148, Unknown=7, NotChecked=0, Total=12210 [2023-02-15 19:43:05,954 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 828 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 4626 mSolverCounterSat, 262 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 4901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4626 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:05,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1370 Invalid, 4901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4626 Invalid, 13 Unknown, 0 Unchecked, 3.5s Time] [2023-02-15 19:43:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-15 19:43:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 157. [2023-02-15 19:43:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 120 states have internal predecessors, (136), 22 states have call successors, (22), 11 states have call predecessors, (22), 18 states have return successors, (37), 25 states have call predecessors, (37), 22 states have call successors, (37) [2023-02-15 19:43:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2023-02-15 19:43:05,978 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 63 [2023-02-15 19:43:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:05,979 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2023-02-15 19:43:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 41 states have internal predecessors, (83), 16 states have call successors, (18), 12 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 19:43:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2023-02-15 19:43:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 19:43:05,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:05,984 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:05,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:06,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:06,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607608, now seen corresponding path program 1 times [2023-02-15 19:43:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:06,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803007600] [2023-02-15 19:43:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 19:43:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-15 19:43:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 19:43:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803007600] [2023-02-15 19:43:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803007600] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599777441] [2023-02-15 19:43:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:06,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:43:06,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:43:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 19:43:06,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:06,633 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:06,637 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:06,726 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:06,731 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 19:43:06,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:06,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599777441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:06,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:43:06,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2023-02-15 19:43:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922146891] [2023-02-15 19:43:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:06,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 19:43:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 19:43:06,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:43:06,903 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 19:43:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:07,348 INFO L93 Difference]: Finished difference Result 325 states and 395 transitions. [2023-02-15 19:43:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:43:07,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 72 [2023-02-15 19:43:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:07,350 INFO L225 Difference]: With dead ends: 325 [2023-02-15 19:43:07,351 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:07,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-15 19:43:07,352 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 174 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:07,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 252 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:43:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2023-02-15 19:43:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 18 states have call successors, (18), 11 states have call predecessors, (18), 16 states have return successors, (27), 20 states have call predecessors, (27), 18 states have call successors, (27) [2023-02-15 19:43:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 166 transitions. [2023-02-15 19:43:07,370 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 166 transitions. Word has length 72 [2023-02-15 19:43:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:07,371 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 166 transitions. [2023-02-15 19:43:07,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 19:43:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 166 transitions. [2023-02-15 19:43:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 19:43:07,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:07,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:07,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:07,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1485354123, now seen corresponding path program 1 times [2023-02-15 19:43:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754002732] [2023-02-15 19:43:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:08,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:10,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-15 19:43:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 19:43:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:10,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754002732] [2023-02-15 19:43:10,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754002732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:10,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66392171] [2023-02-15 19:43:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:10,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:10,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:10,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:43:10,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:43:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:10,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 199 conjunts are in the unsatisfiable core [2023-02-15 19:43:10,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:10,791 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:10,791 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:10,986 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:43:11,013 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:11,016 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:12,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:12,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:12,112 INFO L321 Elim1Store]: treesize reduction 191, result has 14.0 percent of original size [2023-02-15 19:43:12,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 167 [2023-02-15 19:43:12,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:12,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:12,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2023-02-15 19:43:12,123 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:12,137 INFO L321 Elim1Store]: treesize reduction 64, result has 7.2 percent of original size [2023-02-15 19:43:12,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 186 [2023-02-15 19:43:12,145 INFO L350 Elim1Store]: Elim1 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 176 treesize of output 148 [2023-02-15 19:43:12,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 150 treesize of output 100 [2023-02-15 19:43:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:12,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 19:43:12,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2023-02-15 19:43:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:43:12,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:43:15,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66392171] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:15,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:43:15,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2023-02-15 19:43:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076904315] [2023-02-15 19:43:15,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:43:15,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 19:43:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:15,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 19:43:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2934, Unknown=12, NotChecked=0, Total=3192 [2023-02-15 19:43:15,090 INFO L87 Difference]: Start difference. First operand 141 states and 166 transitions. Second operand has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-15 19:43:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:21,234 INFO L93 Difference]: Finished difference Result 326 states and 383 transitions. [2023-02-15 19:43:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 19:43:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) Word has length 66 [2023-02-15 19:43:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:21,236 INFO L225 Difference]: With dead ends: 326 [2023-02-15 19:43:21,236 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 19:43:21,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1159, Invalid=9304, Unknown=43, NotChecked=0, Total=10506 [2023-02-15 19:43:21,239 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 769 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 203 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:21,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 723 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2720 Invalid, 36 Unknown, 0 Unchecked, 2.8s Time] [2023-02-15 19:43:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 19:43:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2023-02-15 19:43:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 116 states have internal predecessors, (128), 17 states have call successors, (17), 12 states have call predecessors, (17), 16 states have return successors, (25), 18 states have call predecessors, (25), 17 states have call successors, (25) [2023-02-15 19:43:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2023-02-15 19:43:21,252 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 66 [2023-02-15 19:43:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:21,253 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2023-02-15 19:43:21,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 40 states have internal predecessors, (89), 12 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 12 states have call successors, (16) [2023-02-15 19:43:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2023-02-15 19:43:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-02-15 19:43:21,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:21,254 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:21,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:21,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:21,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2001187500, now seen corresponding path program 1 times [2023-02-15 19:43:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:21,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132773925] [2023-02-15 19:43:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-02-15 19:43:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:22,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132773925] [2023-02-15 19:43:22,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132773925] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:22,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:22,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 19:43:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781856331] [2023-02-15 19:43:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:22,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 19:43:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:22,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 19:43:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:43:22,119 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-15 19:43:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:22,725 INFO L93 Difference]: Finished difference Result 236 states and 278 transitions. [2023-02-15 19:43:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:43:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2023-02-15 19:43:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:22,726 INFO L225 Difference]: With dead ends: 236 [2023-02-15 19:43:22,726 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:22,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 19:43:22,727 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 254 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:22,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 329 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:43:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 131. [2023-02-15 19:43:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 99 states have (on average 1.121212121212121) internal successors, (111), 101 states have internal predecessors, (111), 17 states have call successors, (17), 12 states have call predecessors, (17), 13 states have return successors, (20), 17 states have call predecessors, (20), 17 states have call successors, (20) [2023-02-15 19:43:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2023-02-15 19:43:22,740 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 104 [2023-02-15 19:43:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:22,740 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2023-02-15 19:43:22,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-15 19:43:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2023-02-15 19:43:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-02-15 19:43:22,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:22,742 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:22,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:43:22,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:22,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -426584195, now seen corresponding path program 1 times [2023-02-15 19:43:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972546261] [2023-02-15 19:43:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-02-15 19:43:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:22,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972546261] [2023-02-15 19:43:22,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972546261] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:22,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:22,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:43:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178346648] [2023-02-15 19:43:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:22,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:43:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:43:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:43:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:43:22,876 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-02-15 19:43:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:23,021 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2023-02-15 19:43:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:43:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2023-02-15 19:43:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:23,023 INFO L225 Difference]: With dead ends: 143 [2023-02-15 19:43:23,023 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 19:43:23,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:43:23,023 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:23,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:43:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 19:43:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2023-02-15 19:43:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.1142857142857143) internal successors, (117), 107 states have internal predecessors, (117), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (22), 19 states have call predecessors, (22), 17 states have call successors, (22) [2023-02-15 19:43:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2023-02-15 19:43:23,036 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 104 [2023-02-15 19:43:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:23,037 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2023-02-15 19:43:23,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-02-15 19:43:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2023-02-15 19:43:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-02-15 19:43:23,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:23,038 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:23,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:43:23,039 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1390622775, now seen corresponding path program 2 times [2023-02-15 19:43:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:43:23,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111338126] [2023-02-15 19:43:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:43:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:43:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 19:43:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:43:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:43:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 19:43:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-02-15 19:43:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-15 19:43:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 19:43:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:25,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 19:43:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:25,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:43:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-02-15 19:43:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 58 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 19:43:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:43:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111338126] [2023-02-15 19:43:26,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111338126] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:43:26,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439372260] [2023-02-15 19:43:26,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:43:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:43:26,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:26,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:43:26,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:43:26,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:43:26,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:43:26,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 210 conjunts are in the unsatisfiable core [2023-02-15 19:43:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:26,565 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:27,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2023-02-15 19:43:27,037 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-15 19:43:27,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2023-02-15 19:43:27,059 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-15 19:43:27,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2023-02-15 19:43:27,115 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:43:27,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:43:27,952 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 4 [2023-02-15 19:43:27,954 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:43:28,350 INFO L321 Elim1Store]: treesize reduction 282, result has 39.4 percent of original size [2023-02-15 19:43:28,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 266 treesize of output 820 [2023-02-15 19:43:28,396 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-02-15 19:43:28,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:28,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2023-02-15 19:43:28,471 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-02-15 19:43:28,557 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-02-15 19:43:29,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:29,481 INFO L321 Elim1Store]: treesize reduction 104, result has 23.0 percent of original size [2023-02-15 19:43:29,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 18 case distinctions, treesize of input 689 treesize of output 927 [2023-02-15 19:43:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,051 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,051 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:31,053 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 241 [2023-02-15 19:43:33,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:43:33,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 185 treesize of output 163 [2023-02-15 19:43:33,030 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-15 19:43:33,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:33,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 19:43:33,238 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) 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:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) 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:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) 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:337) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2023-02-15 19:43:33,243 INFO L158 Benchmark]: Toolchain (without parser) took 44158.06ms. Allocated memory was 134.2MB in the beginning and 696.3MB in the end (delta: 562.0MB). Free memory was 102.4MB in the beginning and 572.6MB in the end (delta: -470.2MB). Peak memory consumption was 356.4MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,243 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:43:33,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.42ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 82.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 134.2MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,243 INFO L158 Benchmark]: Boogie Preprocessor took 45.91ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,243 INFO L158 Benchmark]: RCFGBuilder took 345.60ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 78.2MB in the beginning and 129.5MB in the end (delta: -51.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,244 INFO L158 Benchmark]: TraceAbstraction took 43367.16ms. Allocated memory was 161.5MB in the beginning and 696.3MB in the end (delta: 534.8MB). Free memory was 128.8MB in the beginning and 572.6MB in the end (delta: -443.8MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2023-02-15 19:43:33,245 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.14ms. Allocated memory is still 134.2MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.42ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 82.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 134.2MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.91ms. Allocated memory is still 134.2MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.60ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 78.2MB in the beginning and 129.5MB in the end (delta: -51.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43367.16ms. Allocated memory was 161.5MB in the beginning and 696.3MB in the end (delta: 534.8MB). Free memory was 128.8MB in the beginning and 572.6MB in the end (delta: -443.8MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-15 19:43:33,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:43:34,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:43:34,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:43:34,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:43:34,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:43:34,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:43:34,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:43:34,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:43:34,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:43:34,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:43:34,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:43:34,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:43:34,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:43:34,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:43:34,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:43:34,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:43:34,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:43:34,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:43:34,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:43:34,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:43:34,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:43:34,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:43:34,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:43:34,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:43:34,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:43:34,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:43:34,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:43:34,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:43:34,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:43:34,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:43:34,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:43:34,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:43:34,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:43:35,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:43:35,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:43:35,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:43:35,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:43:35,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:43:35,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:43:35,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:43:35,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:43:35,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 19:43:35,029 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:43:35,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:43:35,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:43:35,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:43:35,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:43:35,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:43:35,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:43:35,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:43:35,031 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:43:35,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:43:35,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:43:35,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:43:35,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:43:35,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:43:35,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:43:35,035 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 19:43:35,035 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:43:35,035 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82f1b23bea4834b28dfbe602ddf1f3e06a3ee60a847e3002a9403f092f2c830 [2023-02-15 19:43:35,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:43:35,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:43:35,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:43:35,305 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:43:35,306 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:43:35,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 19:43:36,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:43:36,509 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:43:36,509 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i [2023-02-15 19:43:36,520 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ff5ebee/a300cec19d244331a69f896be98033cf/FLAG6d3f769b4 [2023-02-15 19:43:36,533 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ff5ebee/a300cec19d244331a69f896be98033cf [2023-02-15 19:43:36,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:43:36,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:43:36,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:43:36,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:43:36,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:43:36,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:36,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2ead63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36, skipping insertion in model container [2023-02-15 19:43:36,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:36,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:43:36,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:43:36,843 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-02-15 19:43:36,847 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-02-15 19:43:36,848 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-02-15 19:43:36,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:36,860 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 19:43:36,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:43:36,903 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-02-15 19:43:36,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-02-15 19:43:36,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-02-15 19:43:36,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:36,906 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:43:36,941 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25842,25855] [2023-02-15 19:43:36,942 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[25967,25980] [2023-02-15 19:43:36,942 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_unlock.i[26082,26095] [2023-02-15 19:43:36,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:43:36,966 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:43:36,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36 WrapperNode [2023-02-15 19:43:36,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:43:36,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:43:36,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:43:36,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:43:36,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:36,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,021 INFO L138 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 125 [2023-02-15 19:43:37,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:43:37,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:43:37,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:43:37,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:43:37,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,043 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:43:37,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:43:37,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:43:37,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:43:37,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (1/1) ... [2023-02-15 19:43:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:43:37,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:43:37,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:43:37,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 19:43:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-02-15 19:43:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-02-15 19:43:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-02-15 19:43:37,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-02-15 19:43:37,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:43:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:43:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:43:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 19:43:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-02-15 19:43:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-02-15 19:43:37,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:43:37,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:43:37,202 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:43:37,203 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:43:37,540 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:43:37,549 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:43:37,551 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 19:43:37,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:43:37 BoogieIcfgContainer [2023-02-15 19:43:37,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:43:37,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:43:37,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:43:37,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:43:37,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:43:36" (1/3) ... [2023-02-15 19:43:37,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bb381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:43:37, skipping insertion in model container [2023-02-15 19:43:37,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:43:36" (2/3) ... [2023-02-15 19:43:37,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bb381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:43:37, skipping insertion in model container [2023-02-15 19:43:37,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:43:37" (3/3) ... [2023-02-15 19:43:37,559 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock.i [2023-02-15 19:43:37,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:43:37,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-02-15 19:43:37,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:43:37,613 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f996940, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:43:37,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-02-15 19:43:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:43:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:37,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:37,620 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] [2023-02-15 19:43:37,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 673246785, now seen corresponding path program 1 times [2023-02-15 19:43:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:37,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041377675] [2023-02-15 19:43:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:37,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:37,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:37,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:37,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 19:43:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:37,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 19:43:37,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:43:37,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:37,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:37,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041377675] [2023-02-15 19:43:37,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041377675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:37,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:37,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:43:37,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769856846] [2023-02-15 19:43:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:37,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:43:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:43:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:43:37,812 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:43:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:37,833 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2023-02-15 19:43:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:43:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-15 19:43:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:37,839 INFO L225 Difference]: With dead ends: 130 [2023-02-15 19:43:37,839 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 19:43:37,842 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 [2023-02-15 19:43:37,844 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:37,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:43:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 19:43:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-15 19:43:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:43:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2023-02-15 19:43:37,870 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 27 [2023-02-15 19:43:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:37,871 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2023-02-15 19:43:37,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 19:43:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2023-02-15 19:43:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:37,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:37,872 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] [2023-02-15 19:43:37,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 19:43:38,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:38,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash -387762175, now seen corresponding path program 1 times [2023-02-15 19:43:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:38,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055687790] [2023-02-15 19:43:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:38,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:38,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 19:43:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 19:43:38,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:43:38,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:38,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055687790] [2023-02-15 19:43:38,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055687790] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:38,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:38,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610406851] [2023-02-15 19:43:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:38,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:43:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:38,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:43:38,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:43:38,488 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:43:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:38,798 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2023-02-15 19:43:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:43:38,799 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 [2023-02-15 19:43:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:38,801 INFO L225 Difference]: With dead ends: 170 [2023-02-15 19:43:38,801 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 19:43:38,802 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 [2023-02-15 19:43:38,802 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 184 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:43:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 19:43:38,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2023-02-15 19:43:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (23), 17 states have call predecessors, (23), 18 states have call successors, (23) [2023-02-15 19:43:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2023-02-15 19:43:38,825 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 27 [2023-02-15 19:43:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:38,826 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2023-02-15 19:43:38,826 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) [2023-02-15 19:43:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2023-02-15 19:43:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:43:38,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:38,827 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] [2023-02-15 19:43:38,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:39,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -438555830, now seen corresponding path program 1 times [2023-02-15 19:43:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:39,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406281123] [2023-02-15 19:43:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:39,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:39,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:39,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 19:43:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:39,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:43:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:43:39,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:39,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:39,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406281123] [2023-02-15 19:43:39,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406281123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:39,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:39,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759066870] [2023-02-15 19:43:39,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:43:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:43:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:43:39,113 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 19:43:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:39,129 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-02-15 19:43:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:43:39,129 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 [2023-02-15 19:43:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:39,131 INFO L225 Difference]: With dead ends: 108 [2023-02-15 19:43:39,131 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:43:39,131 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 [2023-02-15 19:43:39,132 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:39,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:43:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:43:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-02-15 19:43:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2023-02-15 19:43:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2023-02-15 19:43:39,142 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 27 [2023-02-15 19:43:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:39,142 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2023-02-15 19:43:39,142 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) [2023-02-15 19:43:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2023-02-15 19:43:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 19:43:39,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:39,144 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:39,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-15 19:43:39,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:39,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash -811626959, now seen corresponding path program 1 times [2023-02-15 19:43:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:39,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363438289] [2023-02-15 19:43:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:39,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 19:43:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:39,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 19:43:39,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:39,558 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:39,562 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 19:43:39,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:39,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:39,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363438289] [2023-02-15 19:43:39,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363438289] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:39,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:39,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 19:43:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143438427] [2023-02-15 19:43:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:39,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:43:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:43:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:43:39,737 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 19:43:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:40,948 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2023-02-15 19:43:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:43:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 67 [2023-02-15 19:43:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:40,951 INFO L225 Difference]: With dead ends: 268 [2023-02-15 19:43:40,951 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 19:43:40,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-02-15 19:43:40,952 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 167 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:40,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 309 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:43:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 19:43:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-02-15 19:43:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 19 states have call successors, (19), 10 states have call predecessors, (19), 14 states have return successors, (32), 19 states have call predecessors, (32), 19 states have call successors, (32) [2023-02-15 19:43:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-02-15 19:43:40,964 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 67 [2023-02-15 19:43:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:40,967 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-02-15 19:43:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 19:43:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-02-15 19:43:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 19:43:40,968 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:40,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:43:40,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:41,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1108503363, now seen corresponding path program 1 times [2023-02-15 19:43:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:41,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077431122] [2023-02-15 19:43:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:41,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:41,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:41,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 19:43:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:41,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 19:43:41,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-15 19:43:41,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:43:41,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:43:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077431122] [2023-02-15 19:43:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077431122] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:43:41,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:43:41,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:43:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665161888] [2023-02-15 19:43:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:43:41,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:43:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:43:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:43:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:43:41,294 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 19:43:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:43:41,313 INFO L93 Difference]: Finished difference Result 196 states and 237 transitions. [2023-02-15 19:43:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:43:41,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2023-02-15 19:43:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:43:41,315 INFO L225 Difference]: With dead ends: 196 [2023-02-15 19:43:41,315 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 19:43:41,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:43:41,316 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:43:41,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:43:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 19:43:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2023-02-15 19:43:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 77 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2023-02-15 19:43:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2023-02-15 19:43:41,325 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 67 [2023-02-15 19:43:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:43:41,325 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2023-02-15 19:43:41,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-15 19:43:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2023-02-15 19:43:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 19:43:41,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:43:41,326 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] [2023-02-15 19:43:41,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:43:41,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:41,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:43:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:43:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1210243856, now seen corresponding path program 1 times [2023-02-15 19:43:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:43:41,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489640423] [2023-02-15 19:43:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:43:41,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 19:43:41,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:43:41,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 19:43:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 19:43:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:43:41,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-15 19:43:41,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:43:41,733 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 19:43:41,904 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 19:43:41,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 19:43:41,977 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:42,590 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-02-15 19:43:42,591 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:42,624 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:42,652 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:42,666 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:43,038 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:43,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:43:43,057 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 19:43:43,057 INFO L350 Elim1Store]: Elim1 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 239 treesize of output 204 [2023-02-15 19:43:43,074 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:43,116 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:43,126 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:43,178 INFO L321 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2023-02-15 19:43:43,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 16 [2023-02-15 19:43:43,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:43:43,231 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_91 (Array (_ BitVec 32) (_ BitVec 32))) (__ldv_list_add_~next.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (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 __ldv_list_add_~next.offset (_ bv4 32)) |c___ldv_list_add_#in~new.base|)))) (let ((.cse0 (store (store (select .cse1 |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 (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| v_ArrVal_91) |c___ldv_list_add_#in~new.base| .cse0) |c___ldv_list_add_#in~prev.base| (store (select (store .cse1 |c___ldv_list_add_#in~new.base| .cse0) |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))))) (= |c_~#mutexes~0.offset| (_ bv0 32)) (let ((.cse3 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~new.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|))) (or (and .cse2 .cse3) (and (not .cse3) (let ((.cse7 (= |c___ldv_list_add_#in~prev.base| |c___ldv_list_add_#in~next.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|))) (or (and .cse2 (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 ((.cse5 (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 ((.cse4 (select .cse5 |c___ldv_list_add_#in~next.base|))) (and (= (select v_DerPreprocessor_9 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= v_DerPreprocessor_7 .cse4) (= (select .cse5 |c___ldv_list_add_#in~new.base|) .cse6) (= .cse4 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base|)))))) (not .cse7)) (and .cse2 .cse7 (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (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_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))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12) |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12)) (.cse8 (select .cse10 |c___ldv_list_add_#in~new.base|))) (and (= .cse6 .cse8) (= (select v_DerPreprocessor_3 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= v_DerPreprocessor_10 (select .cse9 |c___ldv_list_add_#in~next.base|)) (= (select v_DerPreprocessor_12 |c___ldv_list_add_#in~prev.offset|) |c___ldv_list_add_#in~new.offset|) (= (select .cse9 |c___ldv_list_add_#in~new.base|) .cse8) (= v_DerPreprocessor_1 (select .cse10 |c___ldv_list_add_#in~next.base|))))))))))))) is different from true [2023-02-15 19:43:52,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:45:34,969 WARN L233 SmtUtils]: Spent 1.71m on a formula simplification. DAG size of input: 63 DAG size of output: 32 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:45:34,970 INFO L321 Elim1Store]: treesize reduction 104, result has 33.8 percent of original size [2023-02-15 19:45:34,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 15 new quantified variables, introduced 9 case distinctions, treesize of input 1294 treesize of output 1069 [2023-02-15 19:46:44,122 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification that was a NOOP. DAG size: 57 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 19:46:44,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:46:44,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 963 treesize of output 1043 [2023-02-15 19:46:44,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:44,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:46:44,413 INFO L217 Elim1Store]: Index analysis took 169 ms [2023-02-15 19:46:44,432 INFO L173 IndexEqualityManager]: detected equality via solver