./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:40:40,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:40:40,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:40:40,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:40:40,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:40:40,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:40:40,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:40:40,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:40:40,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:40:40,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:40:40,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:40:40,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:40:40,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:40:40,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:40:40,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:40:40,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:40:40,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:40:40,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:40:40,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:40:40,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:40:40,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:40:40,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:40:40,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:40:40,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:40:40,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:40:40,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:40:40,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:40:40,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:40:40,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:40:40,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:40:40,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:40:40,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:40:40,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:40:40,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:40:40,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:40:40,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:40:40,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:40:40,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:40:40,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:40:40,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:40:40,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:40:40,980 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:40:41,001 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:40:41,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:40:41,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:40:41,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:40:41,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:40:41,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:40:41,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:40:41,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:40:41,003 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:40:41,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:40:41,003 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:40:41,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:40:41,005 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:40:41,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:40:41,005 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:40:41,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:40:41,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:40:41,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:40:41,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:40:41,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:40:41,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:40:41,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:40:41,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:40:41,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:40:41,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:40:41,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:40:41,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:40:41,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:40:41,010 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:40:41,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd310154a8f082280317f3bf1f868dbee13522304c8e13d29736e7fb8b36c7cf [2021-12-14 13:40:41,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:40:41,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:40:41,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:40:41,221 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:40:41,221 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:40:41,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2021-12-14 13:40:41,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf2b451a/0fbb754c0455447bb322a3c94430016d/FLAG88ad91a32 [2021-12-14 13:40:41,710 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:40:41,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i [2021-12-14 13:40:41,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf2b451a/0fbb754c0455447bb322a3c94430016d/FLAG88ad91a32 [2021-12-14 13:40:42,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf2b451a/0fbb754c0455447bb322a3c94430016d [2021-12-14 13:40:42,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:40:42,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:40:42,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:40:42,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:40:42,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:40:42,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d4b62b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42, skipping insertion in model container [2021-12-14 13:40:42,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:40:42,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:40:42,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2021-12-14 13:40:42,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2021-12-14 13:40:42,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2021-12-14 13:40:42,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:40:42,451 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:40:42,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2021-12-14 13:40:42,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2021-12-14 13:40:42,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2021-12-14 13:40:42,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:40:42,518 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:40:42,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42 WrapperNode [2021-12-14 13:40:42,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:40:42,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:40:42,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:40:42,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:40:42,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,575 INFO L137 Inliner]: procedures = 139, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 128 [2021-12-14 13:40:42,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:40:42,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:40:42,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:40:42,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:40:42,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:40:42,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:40:42,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:40:42,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:40:42,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (1/1) ... [2021-12-14 13:40:42,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:40:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:40:42,671 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) [2021-12-14 13:40:42,679 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 [2021-12-14 13:40:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-12-14 13:40:42,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-12-14 13:40:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:40:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2021-12-14 13:40:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2021-12-14 13:40:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:40:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:40:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2021-12-14 13:40:42,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2021-12-14 13:40:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:40:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:40:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:40:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:40:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2021-12-14 13:40:42,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2021-12-14 13:40:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:40:42,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:40:42,796 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:40:42,803 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:40:43,038 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:40:43,044 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:40:43,045 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 13:40:43,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:40:43 BoogieIcfgContainer [2021-12-14 13:40:43,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:40:43,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:40:43,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:40:43,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:40:43,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:40:42" (1/3) ... [2021-12-14 13:40:43,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:40:43, skipping insertion in model container [2021-12-14 13:40:43,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:40:42" (2/3) ... [2021-12-14 13:40:43,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:40:43, skipping insertion in model container [2021-12-14 13:40:43,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:40:43" (3/3) ... [2021-12-14 13:40:43,053 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2021-12-14 13:40:43,057 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:40:43,057 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-12-14 13:40:43,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:40:43,097 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:40:43,098 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-14 13:40:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-14 13:40:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:40:43,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:40:43,118 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:40:43,119 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:40:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:40:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1577806477, now seen corresponding path program 1 times [2021-12-14 13:40:43,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:40:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307119018] [2021-12-14 13:40:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:43,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:40:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:40:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:40:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 13:40:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:40:43,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:40:43,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307119018] [2021-12-14 13:40:43,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307119018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:40:43,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:40:43,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:40:43,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972618719] [2021-12-14 13:40:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:40:43,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:40:43,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:40:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:40:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:40:43,377 INFO L87 Difference]: Start difference. First operand has 66 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 13:40:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:40:43,461 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2021-12-14 13:40:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:40:43,465 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 [2021-12-14 13:40:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:40:43,476 INFO L225 Difference]: With dead ends: 131 [2021-12-14 13:40:43,476 INFO L226 Difference]: Without dead ends: 64 [2021-12-14 13:40:43,480 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:40:43,483 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:40:43,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 109 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:40:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-14 13:40:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2021-12-14 13:40:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-12-14 13:40:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2021-12-14 13:40:43,519 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 28 [2021-12-14 13:40:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:40:43,519 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2021-12-14 13:40:43,537 INFO L471 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) [2021-12-14 13:40:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2021-12-14 13:40:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:40:43,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:40:43,544 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:40:43,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:40:43,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:40:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:40:43,546 INFO L85 PathProgramCache]: Analyzing trace with hash -109345869, now seen corresponding path program 1 times [2021-12-14 13:40:43,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:40:43,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420459697] [2021-12-14 13:40:43,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:43,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:40:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:40:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:40:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 13:40:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:40:43,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:40:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420459697] [2021-12-14 13:40:43,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420459697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:40:43,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:40:43,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:40:43,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689776589] [2021-12-14 13:40:43,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:40:43,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:40:43,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:40:43,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:40:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:40:43,710 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 13:40:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:40:43,826 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2021-12-14 13:40:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:40:43,827 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 [2021-12-14 13:40:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:40:43,829 INFO L225 Difference]: With dead ends: 70 [2021-12-14 13:40:43,829 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 13:40:43,829 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:40:43,830 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:40:43,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 206 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:40:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 13:40:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-12-14 13:40:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-14 13:40:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2021-12-14 13:40:43,840 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 28 [2021-12-14 13:40:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:40:43,841 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2021-12-14 13:40:43,841 INFO L471 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) [2021-12-14 13:40:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2021-12-14 13:40:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:40:43,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:40:43,842 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:40:43,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:40:43,842 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:40:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:40:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1465257436, now seen corresponding path program 1 times [2021-12-14 13:40:43,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:40:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393933532] [2021-12-14 13:40:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:43,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:40:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:40:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:40:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 13:40:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:40:44,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:40:44,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393933532] [2021-12-14 13:40:44,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393933532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:40:44,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:40:44,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:40:44,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783864153] [2021-12-14 13:40:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:40:44,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:40:44,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:40:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:40:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:40:44,014 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 13:40:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:40:44,426 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2021-12-14 13:40:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:40:44,426 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 [2021-12-14 13:40:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:40:44,435 INFO L225 Difference]: With dead ends: 186 [2021-12-14 13:40:44,435 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 13:40:44,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:40:44,440 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:40:44,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 258 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:40:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 13:40:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2021-12-14 13:40:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 77 states have internal predecessors, (83), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2021-12-14 13:40:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2021-12-14 13:40:44,475 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 28 [2021-12-14 13:40:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:40:44,476 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2021-12-14 13:40:44,476 INFO L471 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) [2021-12-14 13:40:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2021-12-14 13:40:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-14 13:40:44,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:40:44,478 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:40:44,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:40:44,479 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:40:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:40:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1566335676, now seen corresponding path program 1 times [2021-12-14 13:40:44,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:40:44,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421148789] [2021-12-14 13:40:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:44,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:40:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:40:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:40:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:40:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:40:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:40:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:40:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 13:40:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 13:40:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:40:45,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:40:45,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421148789] [2021-12-14 13:40:45,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421148789] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:40:45,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846415847] [2021-12-14 13:40:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:40:45,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:40:45,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:40:45,727 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) [2021-12-14 13:40:45,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:40:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:40:45,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 193 conjunts are in the unsatisfiable core [2021-12-14 13:40:45,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:40:46,315 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:40:46,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:40:46,606 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-14 13:40:46,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-14 13:40:46,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:40:46,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:40:49,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,745 INFO L354 Elim1Store]: treesize reduction 168, result has 22.9 percent of original size [2021-12-14 13:40:49,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 122 [2021-12-14 13:40:49,771 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:40:49,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 184 [2021-12-14 13:40:49,804 INFO L354 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2021-12-14 13:40:49,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 123 [2021-12-14 13:40:49,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 23 [2021-12-14 13:40:49,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2021-12-14 13:40:49,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2021-12-14 13:40:49,867 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:40:49,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2021-12-14 13:40:49,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:40:49,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:40:49,904 INFO L354 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2021-12-14 13:40:49,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 35 [2021-12-14 13:40:49,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2021-12-14 13:40:49,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:40:49,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-12-14 13:40:49,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-14 13:40:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 13:40:50,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:40:52,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846415847] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:40:52,490 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:40:52,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2021-12-14 13:40:52,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603746037] [2021-12-14 13:40:52,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:40:52,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-14 13:40:52,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:40:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-14 13:40:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4016, Unknown=25, NotChecked=0, Total=4290 [2021-12-14 13:40:52,493 INFO L87 Difference]: Start difference. First operand 99 states and 118 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) [2021-12-14 13:41:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:00,319 INFO L93 Difference]: Finished difference Result 212 states and 245 transitions. [2021-12-14 13:41:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-14 13:41:00,321 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 [2021-12-14 13:41:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:00,322 INFO L225 Difference]: With dead ends: 212 [2021-12-14 13:41:00,322 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 13:41:00,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=560, Invalid=7241, Unknown=31, NotChecked=0, Total=7832 [2021-12-14 13:41:00,326 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 293 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:00,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 1750 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1670 Invalid, 0 Unknown, 451 Unchecked, 1.2s Time] [2021-12-14 13:41:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 13:41:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2021-12-14 13:41:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 91 states have internal predecessors, (100), 15 states have call successors, (15), 9 states have call predecessors, (15), 13 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) [2021-12-14 13:41:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2021-12-14 13:41:00,353 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 63 [2021-12-14 13:41:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:00,355 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2021-12-14 13:41:00,356 INFO L471 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) [2021-12-14 13:41:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2021-12-14 13:41:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 13:41:00,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:00,363 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:41:00,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:41:00,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:00,588 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1979205398, now seen corresponding path program 1 times [2021-12-14 13:41:00,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:00,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796357487] [2021-12-14 13:41:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:00,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 13:41:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 13:41:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-12-14 13:41:00,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796357487] [2021-12-14 13:41:00,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796357487] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:00,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648600137] [2021-12-14 13:41:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:00,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:00,744 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) [2021-12-14 13:41:00,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:41:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:00,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:41:00,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 13:41:00,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:41:00,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648600137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:00,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:41:00,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-12-14 13:41:00,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916470510] [2021-12-14 13:41:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:00,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:41:00,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:41:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:41:00,985 INFO L87 Difference]: Start difference. First operand 117 states and 139 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 13:41:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:01,003 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2021-12-14 13:41:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:41:01,003 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2021-12-14 13:41:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:01,007 INFO L225 Difference]: With dead ends: 202 [2021-12-14 13:41:01,007 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 13:41:01,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:41:01,011 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 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 [2021-12-14 13:41:01,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:41:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 13:41:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-14 13:41:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 97 states have internal predecessors, (106), 15 states have call successors, (15), 9 states have call predecessors, (15), 15 states have return successors, (27), 18 states have call predecessors, (27), 15 states have call successors, (27) [2021-12-14 13:41:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2021-12-14 13:41:01,040 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 71 [2021-12-14 13:41:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:01,041 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2021-12-14 13:41:01,041 INFO L471 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 13:41:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2021-12-14 13:41:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 13:41:01,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:01,046 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:41:01,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 13:41:01,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:01,262 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2093878652, now seen corresponding path program 1 times [2021-12-14 13:41:01,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:01,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602519123] [2021-12-14 13:41:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:01,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 13:41:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 13:41:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 13:41:01,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602519123] [2021-12-14 13:41:01,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602519123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950965485] [2021-12-14 13:41:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:01,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:01,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:01,504 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) [2021-12-14 13:41:01,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:41:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:01,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-14 13:41:01,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:01,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:01,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 13:41:02,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:41:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950965485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:02,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:41:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2021-12-14 13:41:02,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798671115] [2021-12-14 13:41:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:02,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:41:02,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:41:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-12-14 13:41:02,215 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 13:41:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:02,717 INFO L93 Difference]: Finished difference Result 269 states and 316 transitions. [2021-12-14 13:41:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 13:41:02,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 71 [2021-12-14 13:41:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:02,719 INFO L225 Difference]: With dead ends: 269 [2021-12-14 13:41:02,719 INFO L226 Difference]: Without dead ends: 140 [2021-12-14 13:41:02,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2021-12-14 13:41:02,720 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 155 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:02,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 216 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 13:41:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-14 13:41:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2021-12-14 13:41:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 96 states have internal predecessors, (104), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (23), 16 states have call predecessors, (23), 14 states have call successors, (23) [2021-12-14 13:41:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2021-12-14 13:41:02,731 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 71 [2021-12-14 13:41:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:02,731 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2021-12-14 13:41:02,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-14 13:41:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2021-12-14 13:41:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 13:41:02,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:02,733 INFO L514 BasicCegarLoop]: 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] [2021-12-14 13:41:02,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:41:02,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:02,940 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash -818250910, now seen corresponding path program 1 times [2021-12-14 13:41:02,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736327616] [2021-12-14 13:41:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:02,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:41:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 13:41:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 13:41:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 13:41:03,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:03,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736327616] [2021-12-14 13:41:03,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736327616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:03,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68812542] [2021-12-14 13:41:03,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:03,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:03,692 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) [2021-12-14 13:41:03,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:41:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:03,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 185 conjunts are in the unsatisfiable core [2021-12-14 13:41:03,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:04,144 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:41:04,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:41:04,443 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 13:41:04,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 13:41:04,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:04,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:05,319 INFO L354 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2021-12-14 13:41:05,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 146 [2021-12-14 13:41:05,360 INFO L354 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2021-12-14 13:41:05,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 129 [2021-12-14 13:41:05,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2021-12-14 13:41:05,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2021-12-14 13:41:05,458 INFO L354 Elim1Store]: treesize reduction 74, result has 49.0 percent of original size [2021-12-14 13:41:05,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 94 treesize of output 161 [2021-12-14 13:41:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:05,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 31 [2021-12-14 13:41:05,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:05,797 INFO L354 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2021-12-14 13:41:05,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 156 [2021-12-14 13:41:05,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:05,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:06,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:06,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:06,224 INFO L354 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2021-12-14 13:41:06,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-14 13:41:06,272 INFO L354 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2021-12-14 13:41:06,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-14 13:41:06,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:06,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:06,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:06,817 INFO L354 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2021-12-14 13:41:06,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2021-12-14 13:41:06,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:41:06,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2021-12-14 13:41:07,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:07,016 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 13:41:07,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 64 [2021-12-14 13:41:07,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:07,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:41:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,120 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-14 13:41:07,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 85 [2021-12-14 13:41:07,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:07,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:07,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,428 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-14 13:41:07,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2021-12-14 13:41:07,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2021-12-14 13:41:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:07,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:07,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-12-14 13:41:07,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-14 13:41:07,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:07,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:07,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-14 13:41:07,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:07,848 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:41:07,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 24 [2021-12-14 13:41:07,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:07,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-14 13:41:07,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,083 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:41:08,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:08,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2021-12-14 13:41:08,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-14 13:41:08,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:08,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:08,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 11 [2021-12-14 13:41:08,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:08,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:41:08,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:08,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2021-12-14 13:41:08,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:08,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-14 13:41:08,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,662 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-14 13:41:08,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 28 [2021-12-14 13:41:08,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:08,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:08,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-14 13:41:08,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 13:41:09,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:09,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:09,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-14 13:41:09,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:09,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:09,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-14 13:41:09,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:09,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:10,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-14 13:41:10,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:10,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:10,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-14 13:41:10,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:10,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-14 13:41:10,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-12-14 13:41:10,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 226 [2021-12-14 13:41:10,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,841 INFO L354 Elim1Store]: treesize reduction 176, result has 0.6 percent of original size [2021-12-14 13:41:10,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 314 treesize of output 306 [2021-12-14 13:41:10,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 253 [2021-12-14 13:41:10,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-14 13:41:10,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-14 13:41:10,892 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:41:10,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 257 [2021-12-14 13:41:10,900 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:41:10,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 241 [2021-12-14 13:41:10,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 189 [2021-12-14 13:41:10,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-12-14 13:41:10,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 31 [2021-12-14 13:41:10,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-14 13:41:10,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:41:10,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 24 [2021-12-14 13:41:10,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 15 [2021-12-14 13:41:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:41:11,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:41:13,202 INFO L354 Elim1Store]: treesize reduction 34, result has 68.5 percent of original size [2021-12-14 13:41:13,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 619 treesize of output 363 [2021-12-14 13:41:13,323 INFO L354 Elim1Store]: treesize reduction 90, result has 51.1 percent of original size [2021-12-14 13:41:13,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 343 treesize of output 348 [2021-12-14 13:41:13,341 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:13,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 218 [2021-12-14 13:41:13,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:13,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 215 [2021-12-14 13:41:13,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:13,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 356 [2021-12-14 13:41:13,404 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:13,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 311 [2021-12-14 13:41:13,418 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:13,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 307 [2021-12-14 13:41:16,412 INFO L354 Elim1Store]: treesize reduction 80, result has 42.0 percent of original size [2021-12-14 13:41:16,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 99 [2021-12-14 13:41:16,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:16,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2021-12-14 13:41:16,701 INFO L354 Elim1Store]: treesize reduction 118, result has 22.9 percent of original size [2021-12-14 13:41:16,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 177 [2021-12-14 13:41:16,734 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-14 13:41:16,747 INFO L354 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2021-12-14 13:41:16,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2021-12-14 13:41:16,774 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:16,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 215 treesize of output 223 [2021-12-14 13:41:17,359 INFO L354 Elim1Store]: treesize reduction 80, result has 42.0 percent of original size [2021-12-14 13:41:17,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 171 treesize of output 203 [2021-12-14 13:41:17,376 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:17,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2021-12-14 13:41:17,439 INFO L354 Elim1Store]: treesize reduction 80, result has 42.0 percent of original size [2021-12-14 13:41:17,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 211 [2021-12-14 13:41:17,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:17,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2021-12-14 13:41:17,577 INFO L354 Elim1Store]: treesize reduction 80, result has 47.7 percent of original size [2021-12-14 13:41:17,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 226 [2021-12-14 13:41:17,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2021-12-14 13:41:17,623 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:17,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 76 [2021-12-14 13:41:17,749 INFO L354 Elim1Store]: treesize reduction 80, result has 47.7 percent of original size [2021-12-14 13:41:17,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 367 treesize of output 391 [2021-12-14 13:41:17,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2021-12-14 13:41:17,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2021-12-14 13:41:17,863 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:17,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 338 [2021-12-14 13:41:18,196 INFO L354 Elim1Store]: treesize reduction 80, result has 47.7 percent of original size [2021-12-14 13:41:18,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 114 [2021-12-14 13:41:18,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2021-12-14 13:41:18,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:18,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 76 [2021-12-14 13:41:18,354 INFO L354 Elim1Store]: treesize reduction 80, result has 47.7 percent of original size [2021-12-14 13:41:18,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 183 treesize of output 218 [2021-12-14 13:41:18,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2021-12-14 13:41:18,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:18,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 76 [2021-12-14 13:41:19,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-12-14 13:41:19,855 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-14 13:41:21,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2021-12-14 13:41:21,679 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-14 13:41:25,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mutex_lock_ldv_list_add_~new#1.base_12| Int)) (or (not (= (select |c_#valid| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0)) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse19 (= |v_mutex_lock_ldv_list_add_~new#1.base_12| .cse35)) (.cse21 (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (= |c_~#mutexes~0.base| (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse40 (select (select .cse39 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse39 .cse40 v_ArrVal_612) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse39 .cse40 v_ArrVal_617) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse40) 8 v_ArrVal_619)) |c_~#mutexes~0.base| (store (select (store (store .cse39 .cse40 v_ArrVal_615) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_614) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4)))) (.cse34 (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) 4)))) (.cse22 (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) 0))) (.cse20 (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|))) (let ((.cse8 (not .cse20)) (.cse10 (and .cse34 .cse22)) (.cse17 (or .cse19 .cse21)) (.cse18 (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (and (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (= |c_~#mutexes~0.base| (select (select (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse37 (select (select .cse36 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse36 .cse37 v_ArrVal_612) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse36 .cse37 v_ArrVal_617) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse37) 8 v_ArrVal_619)) |c_~#mutexes~0.base| (store (select (store (store .cse36 .cse37 v_ArrVal_615) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_614) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4))) (or (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|) (= .cse38 |c_~#mutexes~0.offset|))) (and (= |v_mutex_lock_ldv_list_add_~new#1.base_12| (select (select (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (= .cse38 0)))))) (.cse12 (not .cse19)) (.cse15 (= .cse35 |c_~#mutexes~0.base|)) (.cse11 (and .cse34 .cse22 (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) 0))))) (.cse9 (= |c_~#mutexes~0.offset| 4))) (and (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (= .cse0 0) (let ((.cse1 (forall ((v_prenex_329 (Array Int Int)) (v_prenex_333 Int) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (= |c_~#mutexes~0.base| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse7 (select (select .cse6 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse6 .cse7 v_prenex_329) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse6 .cse7 v_prenex_332) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse7) 8 v_prenex_333)) |c_~#mutexes~0.base| (store (select (store (store .cse6 .cse7 v_prenex_331) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_prenex_330) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4)))) (.cse2 (or (= |v_mutex_lock_ldv_list_add_~new#1.base_12| (select (select (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (= |c_~#mutexes~0.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse5 (select (select .cse4 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse4 .cse5 v_ArrVal_612) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse4 .cse5 v_ArrVal_617) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse5) 8 v_ArrVal_619)) |c_~#mutexes~0.base| (store (select (store (store .cse4 .cse5 v_ArrVal_615) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_614) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4)))))) (and .cse1 .cse2 (or (not (= .cse0 4)) (and .cse1 .cse2)) (let ((.cse3 (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|))) (or (and (not .cse3) (= .cse0 |c_~#mutexes~0.offset|)) (and (= |c_~#mutexes~0.offset| 4) .cse3)))))))) (or .cse8 .cse9 .cse10) (or (and (or .cse11 .cse12) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse13 (not (= .cse14 4)))) (or (and .cse13 (not (= .cse14 0))) (and (= |v_mutex_lock_ldv_list_add_~new#1.base_12| (select (select (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) .cse13) (= .cse14 |c_~#mutexes~0.offset|))))) .cse15 (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (or (and (not (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|)) (= .cse16 |c_~#mutexes~0.offset|)) (= .cse16 0)))) (or .cse8 .cse10)) .cse9) (or (and .cse17 .cse18) .cse15) (or (and .cse17 (or .cse19 (and (or (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|) |c_~#mutexes~0.offset|)) .cse20) .cse21)) .cse18) .cse15) (or .cse12 (and (or .cse11 .cse15) (or .cse22 .cse9) (or .cse11 .cse9) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)) (.cse23 (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|))) (or (and .cse23 (= .cse24 0)) (and (or (and (not .cse23) (= .cse24 |c_~#mutexes~0.offset|)) (and (= |c_~#mutexes~0.offset| 4) .cse23)) (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (= |c_~#mutexes~0.base| (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse26 (select (select .cse25 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse25 .cse26 v_ArrVal_612) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse25 .cse26 v_ArrVal_617) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse26) 8 v_ArrVal_619)) |c_~#mutexes~0.base| (store (select (store (store .cse25 .cse26 v_ArrVal_615) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_614) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4))))))))) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_613) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (let ((.cse28 (not (= .cse31 4)))) (or (let ((.cse27 (= |v_mutex_lock_ldv_list_add_~new#1.base_12| (select (select (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|)))) (and (or (and .cse27 .cse28) (and (forall ((v_prenex_329 (Array Int Int)) (v_prenex_333 Int) (v_prenex_330 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int))) (= |c_~#mutexes~0.base| (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse30 (select (select .cse29 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse29 .cse30 v_prenex_329) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse29 .cse30 v_prenex_332) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse30) 8 v_prenex_333)) |c_~#mutexes~0.base| (store (select (store (store .cse29 .cse30 v_prenex_331) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_prenex_330) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4))) (or (and (= |c_~#mutexes~0.offset| 4) (= |v_mutex_lock_ldv_list_add_~new#1.base_12| |c_~#mutexes~0.base|)) (= .cse31 |c_~#mutexes~0.offset|)))) (or .cse27 (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_614 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (= |c_~#mutexes~0.base| (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (select |c_#memory_$Pointer$.base| |v_mutex_lock_ldv_list_add_~new#1.base_12|) 0 |c_ULTIMATE.start_foo_~m1~0#1.base|)))) (let ((.cse33 (select (select .cse32 |c_~#mutexes~0.base|) |c_~#mutexes~0.offset|))) (store (store (store .cse32 .cse33 v_ArrVal_612) |v_mutex_lock_ldv_list_add_~new#1.base_12| (store (store (select (store .cse32 .cse33 v_ArrVal_617) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4 .cse33) 8 v_ArrVal_619)) |c_~#mutexes~0.base| (store (select (store (store .cse32 .cse33 v_ArrVal_615) |v_mutex_lock_ldv_list_add_~new#1.base_12| v_ArrVal_614) |c_~#mutexes~0.base|) |c_~#mutexes~0.offset| |v_mutex_lock_ldv_list_add_~new#1.base_12|)))) |v_mutex_lock_ldv_list_add_~new#1.base_12|) 4)))))) (and .cse28 (not (= .cse31 0))))))))))))) is different from false [2021-12-14 13:41:25,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68812542] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:25,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:41:25,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 48 [2021-12-14 13:41:25,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714328755] [2021-12-14 13:41:25,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:41:25,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 13:41:25,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 13:41:25,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2620, Unknown=20, NotChecked=104, Total=2970 [2021-12-14 13:41:25,661 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 38 states have internal predecessors, (86), 11 states have call successors, (18), 11 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 11 states have call successors, (16) [2021-12-14 13:41:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:28,240 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2021-12-14 13:41:28,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-14 13:41:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 38 states have internal predecessors, (86), 11 states have call successors, (18), 11 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 11 states have call successors, (16) Word has length 66 [2021-12-14 13:41:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:28,241 INFO L225 Difference]: With dead ends: 238 [2021-12-14 13:41:28,241 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 13:41:28,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=805, Invalid=7011, Unknown=20, NotChecked=174, Total=8010 [2021-12-14 13:41:28,244 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 363 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:28,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 955 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1237 Invalid, 0 Unknown, 256 Unchecked, 0.9s Time] [2021-12-14 13:41:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 13:41:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2021-12-14 13:41:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 87 states have internal predecessors, (93), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2021-12-14 13:41:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-14 13:41:28,252 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 66 [2021-12-14 13:41:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:28,252 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-14 13:41:28,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 38 states have internal predecessors, (86), 11 states have call successors, (18), 11 states have call predecessors, (18), 14 states have return successors, (16), 15 states have call predecessors, (16), 11 states have call successors, (16) [2021-12-14 13:41:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-14 13:41:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-14 13:41:28,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:28,254 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:28,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:41:28,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:28,455 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -51453954, now seen corresponding path program 1 times [2021-12-14 13:41:28,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:28,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723523508] [2021-12-14 13:41:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:28,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:41:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 13:41:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 13:41:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 13:41:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 13:41:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-14 13:41:28,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:28,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723523508] [2021-12-14 13:41:28,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723523508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:28,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235649682] [2021-12-14 13:41:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:28,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:28,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:28,724 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) [2021-12-14 13:41:28,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:41:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:28,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 13:41:28,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:29,157 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-12-14 13:41:29,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-14 13:41:29,180 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-12-14 13:41:29,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-14 13:41:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 13:41:29,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:41:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-14 13:41:30,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235649682] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:41:30,279 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:41:30,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 7] total 32 [2021-12-14 13:41:30,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897676788] [2021-12-14 13:41:30,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:41:30,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 13:41:30,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 13:41:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2021-12-14 13:41:30,281 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 32 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 13 states have call successors, (31), 7 states have call predecessors, (31), 14 states have return successors, (32), 13 states have call predecessors, (32), 13 states have call successors, (32) [2021-12-14 13:41:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:31,327 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-14 13:41:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 13:41:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 13 states have call successors, (31), 7 states have call predecessors, (31), 14 states have return successors, (32), 13 states have call predecessors, (32), 13 states have call successors, (32) Word has length 87 [2021-12-14 13:41:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:31,329 INFO L225 Difference]: With dead ends: 153 [2021-12-14 13:41:31,329 INFO L226 Difference]: Without dead ends: 133 [2021-12-14 13:41:31,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=2323, Unknown=0, NotChecked=0, Total=2756 [2021-12-14 13:41:31,330 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 410 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:31,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 592 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 13:41:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-14 13:41:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2021-12-14 13:41:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 88 states have internal predecessors, (94), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2021-12-14 13:41:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-12-14 13:41:31,338 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 87 [2021-12-14 13:41:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:31,338 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-12-14 13:41:31,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.533333333333333) internal successors, (136), 28 states have internal predecessors, (136), 13 states have call successors, (31), 7 states have call predecessors, (31), 14 states have return successors, (32), 13 states have call predecessors, (32), 13 states have call successors, (32) [2021-12-14 13:41:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-12-14 13:41:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-14 13:41:31,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:31,340 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:31,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:41:31,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:31,543 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1523149351, now seen corresponding path program 2 times [2021-12-14 13:41:31,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:31,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492855962] [2021-12-14 13:41:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:31,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:41:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 13:41:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 13:41:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 13:41:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 13:41:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-14 13:41:31,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:31,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492855962] [2021-12-14 13:41:31,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492855962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:41:31,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:41:31,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:41:31,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962089914] [2021-12-14 13:41:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:41:31,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:41:31,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:41:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:41:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:41:31,669 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-14 13:41:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:41:31,773 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-12-14 13:41:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:41:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2021-12-14 13:41:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:41:31,775 INFO L225 Difference]: With dead ends: 123 [2021-12-14 13:41:31,775 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 13:41:31,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:41:31,776 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 55 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:41:31,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 207 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:41:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 13:41:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2021-12-14 13:41:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 90 states have (on average 1.0777777777777777) internal successors, (97), 91 states have internal predecessors, (97), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (15), 15 states have call predecessors, (15), 13 states have call successors, (15) [2021-12-14 13:41:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-12-14 13:41:31,795 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 87 [2021-12-14 13:41:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:41:31,795 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-12-14 13:41:31,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-14 13:41:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-12-14 13:41:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-14 13:41:31,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:41:31,796 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:41:31,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 13:41:31,796 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:41:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:41:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1360136124, now seen corresponding path program 3 times [2021-12-14 13:41:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:41:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075112303] [2021-12-14 13:41:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:41:31,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:41:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 13:41:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 13:41:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:41:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 13:41:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:31,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 13:41:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 13:41:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 13:41:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 13:41:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 13:41:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:41:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 13:41:32,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:41:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075112303] [2021-12-14 13:41:32,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075112303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:41:32,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63381337] [2021-12-14 13:41:32,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:41:32,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:41:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:41:32,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:41:32,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:41:32,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 13:41:32,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:41:32,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 256 conjunts are in the unsatisfiable core [2021-12-14 13:41:32,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:41:32,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:32,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:33,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:41:34,086 INFO L354 Elim1Store]: treesize reduction 246, result has 32.8 percent of original size [2021-12-14 13:41:34,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 338 treesize of output 313 [2021-12-14 13:41:34,110 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:41:34,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 125 treesize of output 127 [2021-12-14 13:41:34,550 INFO L354 Elim1Store]: treesize reduction 508, result has 37.2 percent of original size [2021-12-14 13:41:34,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 14 new quantified variables, introduced 33 case distinctions, treesize of input 2434 treesize of output 1296 [2021-12-14 13:41:34,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-12-14 13:41:34,634 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-14 13:41:34,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 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 111 treesize of output 93 [2021-12-14 13:41:34,753 INFO L354 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2021-12-14 13:41:34,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 178 treesize of output 238 [2021-12-14 13:41:34,827 INFO L354 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2021-12-14 13:41:34,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 176 [2021-12-14 13:41:34,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-12-14 13:41:34,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-12-14 13:41:35,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 13:41:35,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3